/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/test-easy10.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:50:09,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:50:09,410 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:50:09,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:50:09,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:50:09,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:50:09,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:50:09,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:50:09,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:50:09,440 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:50:09,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:50:09,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:50:09,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:50:09,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:50:09,441 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:50:09,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:50:09,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:50:09,441 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:50:09,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:50:09,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:50:09,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:50:09,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:50:09,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:50:09,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:50:09,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:50:09,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:50:09,442 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:50:09,442 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:50:09,442 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:50:09,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:50:09,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:50:09,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:50:09,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:50:09,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:50:09,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:50:09,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:50:09,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:50:09,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:50:09,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:50:09,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:50:09,442 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:50:09,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:50:09,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:50:09,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:50:09,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:50:09,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:50:09,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:50:09,443 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:50:09,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:50:09,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:50:09,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:50:09,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:50:09,663 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:50:09,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy10.wvr.c [2025-04-13 18:50:10,994 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/994d569e3/e7c5bc7612b14577a70c6cd7429c8b47/FLAG020d7fdf7 [2025-04-13 18:50:11,215 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:50:11,215 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy10.wvr.c [2025-04-13 18:50:11,221 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/994d569e3/e7c5bc7612b14577a70c6cd7429c8b47/FLAG020d7fdf7 [2025-04-13 18:50:12,045 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/994d569e3/e7c5bc7612b14577a70c6cd7429c8b47 [2025-04-13 18:50:12,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:50:12,048 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:50:12,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:50:12,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:50:12,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:50:12,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:50:12" (1/1) ... [2025-04-13 18:50:12,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519e4527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:50:12, skipping insertion in model container [2025-04-13 18:50:12,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:50:12" (1/1) ... [2025-04-13 18:50:12,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:50:12,208 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/test-easy10.wvr.c[2547,2560] [2025-04-13 18:50:12,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:50:12,218 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:50:12,247 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/test-easy10.wvr.c[2547,2560] [2025-04-13 18:50:12,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:50:12,260 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:50:12,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:50:12 WrapperNode [2025-04-13 18:50:12,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:50:12,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:50:12,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:50:12,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:50:12,265 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:50:12" (1/1) ... [2025-04-13 18:50:12,270 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:50:12" (1/1) ... [2025-04-13 18:50:12,288 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-04-13 18:50:12,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:50:12,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:50:12,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:50:12,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:50:12,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:50:12" (1/1) ... [2025-04-13 18:50:12,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:50:12" (1/1) ... [2025-04-13 18:50:12,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:50:12" (1/1) ... [2025-04-13 18:50:12,308 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:50:12,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:50:12" (1/1) ... [2025-04-13 18:50:12,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:50:12" (1/1) ... [2025-04-13 18:50:12,311 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:50:12" (1/1) ... [2025-04-13 18:50:12,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:50:12" (1/1) ... [2025-04-13 18:50:12,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:50:12" (1/1) ... [2025-04-13 18:50:12,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:50:12" (1/1) ... [2025-04-13 18:50:12,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:50:12" (1/1) ... [2025-04-13 18:50:12,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:50:12,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:50:12,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:50:12,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:50:12,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:50:12" (1/1) ... [2025-04-13 18:50:12,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:50:12,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:50:12,343 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:50:12,348 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:50:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:50:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:50:12,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:50:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:50:12,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:50:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:50:12,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:50:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 18:50:12,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 18:50:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:50:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:50:12,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:50:12,362 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:50:12,438 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:50:12,439 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:50:12,592 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:50:12,593 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:50:12,593 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:50:12,729 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:50:12,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:50:12 BoogieIcfgContainer [2025-04-13 18:50:12,730 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:50:12,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:50:12,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:50:12,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:50:12,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:50:12" (1/3) ... [2025-04-13 18:50:12,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194b1c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:50:12, skipping insertion in model container [2025-04-13 18:50:12,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:50:12" (2/3) ... [2025-04-13 18:50:12,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194b1c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:50:12, skipping insertion in model container [2025-04-13 18:50:12,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:50:12" (3/3) ... [2025-04-13 18:50:12,737 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy10.wvr.c [2025-04-13 18:50:12,749 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:50:12,750 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy10.wvr.c that has 5 procedures, 60 locations, 55 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 18:50:12,750 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:50:12,799 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 18:50:12,825 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 59 transitions, 146 flow [2025-04-13 18:50:13,323 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 15591 states, 15590 states have (on average 3.9752405388069274) internal successors, (61974), 15590 states have internal predecessors, (61974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:13,343 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:50:13,351 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;@76f8a10d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:50:13,351 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 18:50:13,392 INFO L278 IsEmpty]: Start isEmpty. Operand has 15591 states, 15590 states have (on average 3.9752405388069274) internal successors, (61974), 15590 states have internal predecessors, (61974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:13,541 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:13,542 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:13,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:13,543 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 2 more)] === [2025-04-13 18:50:13,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1491111998, now seen corresponding path program 1 times [2025-04-13 18:50:13,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:13,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737294372] [2025-04-13 18:50:13,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:50:13,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:13,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:13,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:13,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:50:13,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:14,119 INFO L134 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:50:14,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:14,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737294372] [2025-04-13 18:50:14,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737294372] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:14,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:14,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:50:14,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201895751] [2025-04-13 18:50:14,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:14,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:50:14,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:14,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:50:14,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:50:14,179 INFO L87 Difference]: Start difference. First operand has 15591 states, 15590 states have (on average 3.9752405388069274) internal successors, (61974), 15590 states have internal predecessors, (61974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:14,526 INFO L93 Difference]: Finished difference Result 19728 states and 77409 transitions. [2025-04-13 18:50:14,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:50:14,528 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:14,528 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:14,647 INFO L225 Difference]: With dead ends: 19728 [2025-04-13 18:50:14,648 INFO L226 Difference]: Without dead ends: 12347 [2025-04-13 18:50:14,670 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:50:14,672 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 25 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:14,672 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 48 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:50:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12347 states. [2025-04-13 18:50:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12347 to 12347. [2025-04-13 18:50:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12347 states, 12346 states have (on average 3.922728009071764) internal successors, (48430), 12346 states have internal predecessors, (48430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12347 states to 12347 states and 48430 transitions. [2025-04-13 18:50:15,264 INFO L79 Accepts]: Start accepts. Automaton has 12347 states and 48430 transitions. Word has length 54 [2025-04-13 18:50:15,265 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:15,265 INFO L485 AbstractCegarLoop]: Abstraction has 12347 states and 48430 transitions. [2025-04-13 18:50:15,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:15,265 INFO L278 IsEmpty]: Start isEmpty. Operand 12347 states and 48430 transitions. [2025-04-13 18:50:15,304 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:15,305 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:15,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:15,305 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:50:15,306 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 2 more)] === [2025-04-13 18:50:15,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash -75327600, now seen corresponding path program 2 times [2025-04-13 18:50:15,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:15,307 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928155929] [2025-04-13 18:50:15,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:50:15,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:15,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:15,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:15,338 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:50:15,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:15,584 INFO L134 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:50:15,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:15,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928155929] [2025-04-13 18:50:15,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928155929] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:15,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:15,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:50:15,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608769450] [2025-04-13 18:50:15,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:15,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:50:15,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:15,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:50:15,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:50:15,587 INFO L87 Difference]: Start difference. First operand 12347 states and 48430 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:15,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:15,885 INFO L93 Difference]: Finished difference Result 15074 states and 58637 transitions. [2025-04-13 18:50:15,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:50:15,886 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:15,886 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:15,949 INFO L225 Difference]: With dead ends: 15074 [2025-04-13 18:50:15,949 INFO L226 Difference]: Without dead ends: 9647 [2025-04-13 18:50:15,959 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:50:15,960 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:15,961 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 48 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:50:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9647 states. [2025-04-13 18:50:16,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9647 to 9647. [2025-04-13 18:50:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9647 states, 9646 states have (on average 3.8720713249015137) internal successors, (37350), 9646 states have internal predecessors, (37350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9647 states to 9647 states and 37350 transitions. [2025-04-13 18:50:16,303 INFO L79 Accepts]: Start accepts. Automaton has 9647 states and 37350 transitions. Word has length 54 [2025-04-13 18:50:16,305 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:16,305 INFO L485 AbstractCegarLoop]: Abstraction has 9647 states and 37350 transitions. [2025-04-13 18:50:16,306 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:16,306 INFO L278 IsEmpty]: Start isEmpty. Operand 9647 states and 37350 transitions. [2025-04-13 18:50:16,340 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:16,340 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:16,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:16,341 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:50:16,342 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 2 more)] === [2025-04-13 18:50:16,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:16,342 INFO L85 PathProgramCache]: Analyzing trace with hash 414123452, now seen corresponding path program 3 times [2025-04-13 18:50:16,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:16,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150172262] [2025-04-13 18:50:16,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:50:16,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:16,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:16,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:16,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:50:16,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:18,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:50:18,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:18,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150172262] [2025-04-13 18:50:18,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150172262] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:18,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:18,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:18,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533872281] [2025-04-13 18:50:18,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:18,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:18,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:18,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:18,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:18,442 INFO L87 Difference]: Start difference. First operand 9647 states and 37350 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:19,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:19,808 INFO L93 Difference]: Finished difference Result 17967 states and 66971 transitions. [2025-04-13 18:50:19,808 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:50:19,809 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:19,809 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:19,896 INFO L225 Difference]: With dead ends: 17967 [2025-04-13 18:50:19,896 INFO L226 Difference]: Without dead ends: 17855 [2025-04-13 18:50:19,904 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:50:19,906 INFO L437 NwaCegarLoop]: 120 mSDtfsCounter, 295 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:19,907 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 573 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:50:19,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17855 states. [2025-04-13 18:50:20,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17855 to 10107. [2025-04-13 18:50:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10107 states, 10106 states have (on average 3.8537502473777954) internal successors, (38946), 10106 states have internal predecessors, (38946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10107 states to 10107 states and 38946 transitions. [2025-04-13 18:50:20,276 INFO L79 Accepts]: Start accepts. Automaton has 10107 states and 38946 transitions. Word has length 54 [2025-04-13 18:50:20,277 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:20,277 INFO L485 AbstractCegarLoop]: Abstraction has 10107 states and 38946 transitions. [2025-04-13 18:50:20,277 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:20,278 INFO L278 IsEmpty]: Start isEmpty. Operand 10107 states and 38946 transitions. [2025-04-13 18:50:20,302 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:20,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:20,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:50:20,303 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:50:20,303 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 2 more)] === [2025-04-13 18:50:20,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:20,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1754654832, now seen corresponding path program 4 times [2025-04-13 18:50:20,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:20,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686931270] [2025-04-13 18:50:20,304 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:50:20,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:20,313 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:50:20,362 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:20,365 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:50:20,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:21,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:50:21,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:21,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686931270] [2025-04-13 18:50:21,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686931270] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:21,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:21,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:21,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712367206] [2025-04-13 18:50:21,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:21,693 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:21,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:21,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:21,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:21,694 INFO L87 Difference]: Start difference. First operand 10107 states and 38946 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:22,963 INFO L93 Difference]: Finished difference Result 19471 states and 72001 transitions. [2025-04-13 18:50:22,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:50:22,964 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:22,964 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:23,037 INFO L225 Difference]: With dead ends: 19471 [2025-04-13 18:50:23,038 INFO L226 Difference]: Without dead ends: 19335 [2025-04-13 18:50:23,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:50:23,047 INFO L437 NwaCegarLoop]: 120 mSDtfsCounter, 313 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:23,048 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 531 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:50:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19335 states. [2025-04-13 18:50:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19335 to 10614. [2025-04-13 18:50:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10614 states, 10613 states have (on average 3.8304909073777442) internal successors, (40653), 10613 states have internal predecessors, (40653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10614 states to 10614 states and 40653 transitions. [2025-04-13 18:50:23,391 INFO L79 Accepts]: Start accepts. Automaton has 10614 states and 40653 transitions. Word has length 54 [2025-04-13 18:50:23,391 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:23,391 INFO L485 AbstractCegarLoop]: Abstraction has 10614 states and 40653 transitions. [2025-04-13 18:50:23,392 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:23,392 INFO L278 IsEmpty]: Start isEmpty. Operand 10614 states and 40653 transitions. [2025-04-13 18:50:23,413 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:23,413 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:23,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] [2025-04-13 18:50:23,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:50:23,413 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 2 more)] === [2025-04-13 18:50:23,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:23,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1772505668, now seen corresponding path program 5 times [2025-04-13 18:50:23,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:23,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047631921] [2025-04-13 18:50:23,414 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:50:23,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:23,421 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:23,465 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:23,465 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:50:23,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:24,622 INFO L134 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:50:24,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:24,622 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047631921] [2025-04-13 18:50:24,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047631921] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:24,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:24,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:24,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313924178] [2025-04-13 18:50:24,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:24,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:24,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:24,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:24,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:24,624 INFO L87 Difference]: Start difference. First operand 10614 states and 40653 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:25,817 INFO L93 Difference]: Finished difference Result 18502 states and 68711 transitions. [2025-04-13 18:50:25,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:50:25,817 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:25,818 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:25,881 INFO L225 Difference]: With dead ends: 18502 [2025-04-13 18:50:25,882 INFO L226 Difference]: Without dead ends: 18438 [2025-04-13 18:50:25,889 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:50:25,890 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 313 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:25,890 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 592 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:50:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18438 states. [2025-04-13 18:50:26,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18438 to 10622. [2025-04-13 18:50:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10622 states, 10621 states have (on average 3.829488748705395) internal successors, (40673), 10621 states have internal predecessors, (40673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:26,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10622 states to 10622 states and 40673 transitions. [2025-04-13 18:50:26,257 INFO L79 Accepts]: Start accepts. Automaton has 10622 states and 40673 transitions. Word has length 54 [2025-04-13 18:50:26,257 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:26,257 INFO L485 AbstractCegarLoop]: Abstraction has 10622 states and 40673 transitions. [2025-04-13 18:50:26,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:26,257 INFO L278 IsEmpty]: Start isEmpty. Operand 10622 states and 40673 transitions. [2025-04-13 18:50:26,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:26,277 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:26,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] [2025-04-13 18:50:26,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:50:26,277 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 2 more)] === [2025-04-13 18:50:26,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:26,278 INFO L85 PathProgramCache]: Analyzing trace with hash 353683344, now seen corresponding path program 6 times [2025-04-13 18:50:26,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:26,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425120235] [2025-04-13 18:50:26,278 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:50:26,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:26,285 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:26,312 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:26,313 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:50:26,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:27,439 INFO L134 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:50:27,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:27,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425120235] [2025-04-13 18:50:27,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425120235] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:27,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:27,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:27,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896838415] [2025-04-13 18:50:27,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:27,440 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:27,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:27,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:27,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:27,440 INFO L87 Difference]: Start difference. First operand 10622 states and 40673 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:28,524 INFO L93 Difference]: Finished difference Result 19495 states and 72011 transitions. [2025-04-13 18:50:28,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:50:28,524 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:28,525 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:28,591 INFO L225 Difference]: With dead ends: 19495 [2025-04-13 18:50:28,591 INFO L226 Difference]: Without dead ends: 19425 [2025-04-13 18:50:28,599 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:50:28,599 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 309 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:28,600 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 549 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:50:28,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19425 states. [2025-04-13 18:50:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19425 to 10633. [2025-04-13 18:50:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10633 states, 10632 states have (on average 3.828066215199398) internal successors, (40700), 10632 states have internal predecessors, (40700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 40700 transitions. [2025-04-13 18:50:28,946 INFO L79 Accepts]: Start accepts. Automaton has 10633 states and 40700 transitions. Word has length 54 [2025-04-13 18:50:28,946 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:28,946 INFO L485 AbstractCegarLoop]: Abstraction has 10633 states and 40700 transitions. [2025-04-13 18:50:28,946 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:28,946 INFO L278 IsEmpty]: Start isEmpty. Operand 10633 states and 40700 transitions. [2025-04-13 18:50:28,963 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:28,963 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:28,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:28,964 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:50:28,964 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 2 more)] === [2025-04-13 18:50:28,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:28,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1751983646, now seen corresponding path program 7 times [2025-04-13 18:50:28,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:28,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739665686] [2025-04-13 18:50:28,965 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:50:28,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:28,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:28,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:28,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:50:28,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:30,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:50:30,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:30,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739665686] [2025-04-13 18:50:30,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739665686] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:30,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:30,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:30,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396713696] [2025-04-13 18:50:30,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:30,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:30,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:30,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:30,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:30,010 INFO L87 Difference]: Start difference. First operand 10633 states and 40700 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:31,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:31,034 INFO L93 Difference]: Finished difference Result 18449 states and 68569 transitions. [2025-04-13 18:50:31,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:50:31,034 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:31,034 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:31,096 INFO L225 Difference]: With dead ends: 18449 [2025-04-13 18:50:31,096 INFO L226 Difference]: Without dead ends: 18349 [2025-04-13 18:50:31,103 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:50:31,104 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 285 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:31,104 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 543 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:50:31,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18349 states. [2025-04-13 18:50:31,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18349 to 10601. [2025-04-13 18:50:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10601 states, 10600 states have (on average 3.829811320754717) internal successors, (40596), 10600 states have internal predecessors, (40596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10601 states to 10601 states and 40596 transitions. [2025-04-13 18:50:31,438 INFO L79 Accepts]: Start accepts. Automaton has 10601 states and 40596 transitions. Word has length 54 [2025-04-13 18:50:31,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:31,438 INFO L485 AbstractCegarLoop]: Abstraction has 10601 states and 40596 transitions. [2025-04-13 18:50:31,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:31,438 INFO L278 IsEmpty]: Start isEmpty. Operand 10601 states and 40596 transitions. [2025-04-13 18:50:31,456 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:31,457 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:31,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] [2025-04-13 18:50:31,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:50:31,457 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 2 more)] === [2025-04-13 18:50:31,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:31,458 INFO L85 PathProgramCache]: Analyzing trace with hash -416794638, now seen corresponding path program 8 times [2025-04-13 18:50:31,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:31,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367101792] [2025-04-13 18:50:31,458 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:50:31,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:31,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:31,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:31,486 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:50:31,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:32,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:50:32,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:32,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367101792] [2025-04-13 18:50:32,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367101792] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:32,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:32,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:32,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520710057] [2025-04-13 18:50:32,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:32,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:32,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:32,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:32,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:32,522 INFO L87 Difference]: Start difference. First operand 10601 states and 40596 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:33,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:33,480 INFO L93 Difference]: Finished difference Result 19393 states and 71718 transitions. [2025-04-13 18:50:33,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:50:33,480 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:33,480 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:33,547 INFO L225 Difference]: With dead ends: 19393 [2025-04-13 18:50:33,548 INFO L226 Difference]: Without dead ends: 19278 [2025-04-13 18:50:33,555 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:50:33,556 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 296 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:33,556 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 565 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:50:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19278 states. [2025-04-13 18:50:33,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19278 to 10557. [2025-04-13 18:50:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10557 states, 10556 states have (on average 3.8324175824175826) internal successors, (40455), 10556 states have internal predecessors, (40455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10557 states to 10557 states and 40455 transitions. [2025-04-13 18:50:33,850 INFO L79 Accepts]: Start accepts. Automaton has 10557 states and 40455 transitions. Word has length 54 [2025-04-13 18:50:33,850 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:33,850 INFO L485 AbstractCegarLoop]: Abstraction has 10557 states and 40455 transitions. [2025-04-13 18:50:33,850 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:33,850 INFO L278 IsEmpty]: Start isEmpty. Operand 10557 states and 40455 transitions. [2025-04-13 18:50:33,868 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:33,868 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:33,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:33,868 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 18:50:33,868 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 2 more)] === [2025-04-13 18:50:33,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2008342242, now seen corresponding path program 9 times [2025-04-13 18:50:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:33,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160614744] [2025-04-13 18:50:33,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:50:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:33,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:33,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:33,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:50:33,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:34,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:50:34,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:34,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160614744] [2025-04-13 18:50:34,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160614744] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:34,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:34,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:34,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786355805] [2025-04-13 18:50:34,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:34,790 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:34,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:34,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:34,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:34,791 INFO L87 Difference]: Start difference. First operand 10557 states and 40455 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:35,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:35,780 INFO L93 Difference]: Finished difference Result 18457 states and 68576 transitions. [2025-04-13 18:50:35,781 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:50:35,781 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:35,781 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:35,845 INFO L225 Difference]: With dead ends: 18457 [2025-04-13 18:50:35,845 INFO L226 Difference]: Without dead ends: 18393 [2025-04-13 18:50:35,851 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=434, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:50:35,851 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 289 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:35,851 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 522 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:50:35,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18393 states. [2025-04-13 18:50:36,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18393 to 10581. [2025-04-13 18:50:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10581 states, 10580 states have (on average 3.8309073724007563) internal successors, (40531), 10580 states have internal predecessors, (40531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10581 states to 10581 states and 40531 transitions. [2025-04-13 18:50:36,087 INFO L79 Accepts]: Start accepts. Automaton has 10581 states and 40531 transitions. Word has length 54 [2025-04-13 18:50:36,087 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:36,087 INFO L485 AbstractCegarLoop]: Abstraction has 10581 states and 40531 transitions. [2025-04-13 18:50:36,087 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:36,087 INFO L278 IsEmpty]: Start isEmpty. Operand 10581 states and 40531 transitions. [2025-04-13 18:50:36,105 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:36,105 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:36,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:36,105 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:50:36,105 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 2 more)] === [2025-04-13 18:50:36,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:36,106 INFO L85 PathProgramCache]: Analyzing trace with hash 117846770, now seen corresponding path program 10 times [2025-04-13 18:50:36,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:36,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136519220] [2025-04-13 18:50:36,106 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:50:36,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:36,110 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:50:36,128 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:36,128 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:50:36,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:36,973 INFO L134 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:50:36,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:36,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136519220] [2025-04-13 18:50:36,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136519220] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:36,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:36,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:36,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359195337] [2025-04-13 18:50:36,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:36,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:36,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:36,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:36,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:36,974 INFO L87 Difference]: Start difference. First operand 10581 states and 40531 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:38,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:38,096 INFO L93 Difference]: Finished difference Result 19484 states and 71980 transitions. [2025-04-13 18:50:38,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:50:38,096 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:38,096 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:38,166 INFO L225 Difference]: With dead ends: 19484 [2025-04-13 18:50:38,166 INFO L226 Difference]: Without dead ends: 19414 [2025-04-13 18:50:38,173 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=433, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:50:38,174 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 302 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:38,174 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 581 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:50:38,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19414 states. [2025-04-13 18:50:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19414 to 10614. [2025-04-13 18:50:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10614 states, 10613 states have (on average 3.828700650146047) internal successors, (40634), 10613 states have internal predecessors, (40634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10614 states to 10614 states and 40634 transitions. [2025-04-13 18:50:38,445 INFO L79 Accepts]: Start accepts. Automaton has 10614 states and 40634 transitions. Word has length 54 [2025-04-13 18:50:38,445 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:38,445 INFO L485 AbstractCegarLoop]: Abstraction has 10614 states and 40634 transitions. [2025-04-13 18:50:38,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:38,445 INFO L278 IsEmpty]: Start isEmpty. Operand 10614 states and 40634 transitions. [2025-04-13 18:50:38,464 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:38,464 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:38,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:38,464 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:50:38,464 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 2 more)] === [2025-04-13 18:50:38,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1516147072, now seen corresponding path program 11 times [2025-04-13 18:50:38,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:38,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408513726] [2025-04-13 18:50:38,465 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:50:38,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:38,469 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:38,486 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:38,486 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:50:38,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:50:39,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:39,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408513726] [2025-04-13 18:50:39,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408513726] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:39,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:39,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:39,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609400386] [2025-04-13 18:50:39,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:39,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:39,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:39,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:39,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:39,362 INFO L87 Difference]: Start difference. First operand 10614 states and 40634 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:40,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:40,314 INFO L93 Difference]: Finished difference Result 18494 states and 68683 transitions. [2025-04-13 18:50:40,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:50:40,314 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:40,314 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:40,373 INFO L225 Difference]: With dead ends: 18494 [2025-04-13 18:50:40,373 INFO L226 Difference]: Without dead ends: 18418 [2025-04-13 18:50:40,380 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:50:40,381 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 283 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:40,381 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 548 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:50:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18418 states. [2025-04-13 18:50:40,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18418 to 10606. [2025-04-13 18:50:40,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10606 states, 10605 states have (on average 3.828948609146629) internal successors, (40606), 10605 states have internal predecessors, (40606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10606 states to 10606 states and 40606 transitions. [2025-04-13 18:50:40,640 INFO L79 Accepts]: Start accepts. Automaton has 10606 states and 40606 transitions. Word has length 54 [2025-04-13 18:50:40,640 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:40,640 INFO L485 AbstractCegarLoop]: Abstraction has 10606 states and 40606 transitions. [2025-04-13 18:50:40,640 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:40,641 INFO L278 IsEmpty]: Start isEmpty. Operand 10606 states and 40606 transitions. [2025-04-13 18:50:40,661 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:40,661 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:40,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:50:40,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 18:50:40,662 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 2 more)] === [2025-04-13 18:50:40,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:40,662 INFO L85 PathProgramCache]: Analyzing trace with hash -652631212, now seen corresponding path program 12 times [2025-04-13 18:50:40,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:40,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875835132] [2025-04-13 18:50:40,662 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:50:40,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:40,667 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:40,722 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:40,722 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:50:40,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:41,537 INFO L134 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:50:41,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:41,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875835132] [2025-04-13 18:50:41,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875835132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:41,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:41,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:41,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905779528] [2025-04-13 18:50:41,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:41,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:41,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:41,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:41,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:41,539 INFO L87 Difference]: Start difference. First operand 10606 states and 40606 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:42,481 INFO L93 Difference]: Finished difference Result 19477 states and 71943 transitions. [2025-04-13 18:50:42,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:50:42,481 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:42,481 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:42,544 INFO L225 Difference]: With dead ends: 19477 [2025-04-13 18:50:42,544 INFO L226 Difference]: Without dead ends: 19395 [2025-04-13 18:50:42,552 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=401, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:50:42,552 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 298 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:42,553 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 518 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:50:42,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19395 states. [2025-04-13 18:50:42,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19395 to 10595. [2025-04-13 18:50:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10595 states, 10594 states have (on average 3.8293373607702472) internal successors, (40568), 10594 states have internal predecessors, (40568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10595 states to 10595 states and 40568 transitions. [2025-04-13 18:50:42,806 INFO L79 Accepts]: Start accepts. Automaton has 10595 states and 40568 transitions. Word has length 54 [2025-04-13 18:50:42,806 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:42,806 INFO L485 AbstractCegarLoop]: Abstraction has 10595 states and 40568 transitions. [2025-04-13 18:50:42,806 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:42,806 INFO L278 IsEmpty]: Start isEmpty. Operand 10595 states and 40568 transitions. [2025-04-13 18:50:42,823 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:42,823 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:42,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:42,823 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:50:42,823 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 2 more)] === [2025-04-13 18:50:42,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:42,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1170505042, now seen corresponding path program 13 times [2025-04-13 18:50:42,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:42,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289976112] [2025-04-13 18:50:42,824 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:50:42,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:42,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:42,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:42,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:50:42,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:43,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:50:43,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:43,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289976112] [2025-04-13 18:50:43,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289976112] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:43,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:43,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:43,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775892289] [2025-04-13 18:50:43,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:43,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:43,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:43,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:43,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:43,637 INFO L87 Difference]: Start difference. First operand 10595 states and 40568 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:44,540 INFO L93 Difference]: Finished difference Result 18407 states and 68444 transitions. [2025-04-13 18:50:44,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:50:44,540 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:44,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:44,600 INFO L225 Difference]: With dead ends: 18407 [2025-04-13 18:50:44,600 INFO L226 Difference]: Without dead ends: 18171 [2025-04-13 18:50:44,608 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:50:44,609 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 260 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:44,609 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 485 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:50:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18171 states. [2025-04-13 18:50:44,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18171 to 10467. [2025-04-13 18:50:44,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10467 states, 10466 states have (on average 3.837187081979744) internal successors, (40160), 10466 states have internal predecessors, (40160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10467 states to 10467 states and 40160 transitions. [2025-04-13 18:50:44,853 INFO L79 Accepts]: Start accepts. Automaton has 10467 states and 40160 transitions. Word has length 54 [2025-04-13 18:50:44,854 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:44,854 INFO L485 AbstractCegarLoop]: Abstraction has 10467 states and 40160 transitions. [2025-04-13 18:50:44,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:44,854 INFO L278 IsEmpty]: Start isEmpty. Operand 10467 states and 40160 transitions. [2025-04-13 18:50:44,872 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:44,872 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:44,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:44,872 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 18:50:44,872 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 2 more)] === [2025-04-13 18:50:44,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:44,873 INFO L85 PathProgramCache]: Analyzing trace with hash 955683970, now seen corresponding path program 14 times [2025-04-13 18:50:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:44,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125087092] [2025-04-13 18:50:44,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:50:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:44,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:44,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:44,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:50:44,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:45,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:50:45,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:45,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125087092] [2025-04-13 18:50:45,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125087092] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:45,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:45,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:45,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570421246] [2025-04-13 18:50:45,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:45,744 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:45,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:45,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:45,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:45,744 INFO L87 Difference]: Start difference. First operand 10467 states and 40160 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:46,717 INFO L93 Difference]: Finished difference Result 19267 states and 71317 transitions. [2025-04-13 18:50:46,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:50:46,718 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:46,718 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:46,782 INFO L225 Difference]: With dead ends: 19267 [2025-04-13 18:50:46,782 INFO L226 Difference]: Without dead ends: 18958 [2025-04-13 18:50:46,788 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=400, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:50:46,788 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 275 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:46,788 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 582 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:50:46,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18958 states. [2025-04-13 18:50:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18958 to 10275. [2025-04-13 18:50:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10275 states, 10274 states have (on average 3.851275063266498) internal successors, (39568), 10274 states have internal predecessors, (39568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10275 states to 10275 states and 39568 transitions. [2025-04-13 18:50:47,013 INFO L79 Accepts]: Start accepts. Automaton has 10275 states and 39568 transitions. Word has length 54 [2025-04-13 18:50:47,014 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:47,014 INFO L485 AbstractCegarLoop]: Abstraction has 10275 states and 39568 transitions. [2025-04-13 18:50:47,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:47,014 INFO L278 IsEmpty]: Start isEmpty. Operand 10275 states and 39568 transitions. [2025-04-13 18:50:47,029 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:47,030 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:47,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:47,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 18:50:47,030 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 2 more)] === [2025-04-13 18:50:47,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:47,030 INFO L85 PathProgramCache]: Analyzing trace with hash -572257730, now seen corresponding path program 15 times [2025-04-13 18:50:47,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:47,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223586863] [2025-04-13 18:50:47,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:50:47,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:47,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:47,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:47,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:50:47,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:47,923 INFO L134 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:50:47,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:47,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223586863] [2025-04-13 18:50:47,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223586863] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:47,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:47,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:47,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848802461] [2025-04-13 18:50:47,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:47,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:47,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:47,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:47,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:47,924 INFO L87 Difference]: Start difference. First operand 10275 states and 39568 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:48,884 INFO L93 Difference]: Finished difference Result 18537 states and 68838 transitions. [2025-04-13 18:50:48,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:50:48,885 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:48,885 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:48,944 INFO L225 Difference]: With dead ends: 18537 [2025-04-13 18:50:48,945 INFO L226 Difference]: Without dead ends: 18473 [2025-04-13 18:50:48,952 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:50:48,952 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 332 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:48,952 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 589 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:50:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18473 states. [2025-04-13 18:50:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18473 to 10351. [2025-04-13 18:50:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10351 states, 10350 states have (on average 3.849661835748792) internal successors, (39844), 10350 states have internal predecessors, (39844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10351 states to 10351 states and 39844 transitions. [2025-04-13 18:50:49,189 INFO L79 Accepts]: Start accepts. Automaton has 10351 states and 39844 transitions. Word has length 54 [2025-04-13 18:50:49,189 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:49,189 INFO L485 AbstractCegarLoop]: Abstraction has 10351 states and 39844 transitions. [2025-04-13 18:50:49,189 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:49,190 INFO L278 IsEmpty]: Start isEmpty. Operand 10351 states and 39844 transitions. [2025-04-13 18:50:49,206 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:49,206 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:49,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:49,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 18:50:49,206 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 2 more)] === [2025-04-13 18:50:49,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2127712210, now seen corresponding path program 16 times [2025-04-13 18:50:49,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:49,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675194711] [2025-04-13 18:50:49,207 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:50:49,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:49,211 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:50:49,225 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:49,225 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:50:49,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:50,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:50:50,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:50,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675194711] [2025-04-13 18:50:50,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675194711] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:50,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:50,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:50,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175464760] [2025-04-13 18:50:50,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:50,111 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:50,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:50,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:50,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:50,111 INFO L87 Difference]: Start difference. First operand 10351 states and 39844 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:51,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:51,131 INFO L93 Difference]: Finished difference Result 19623 states and 72473 transitions. [2025-04-13 18:50:51,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:50:51,131 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:51,131 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:51,190 INFO L225 Difference]: With dead ends: 19623 [2025-04-13 18:50:51,190 INFO L226 Difference]: Without dead ends: 19553 [2025-04-13 18:50:51,197 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:50:51,197 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 335 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:51,197 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 566 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:50:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19553 states. [2025-04-13 18:50:51,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19553 to 10427. [2025-04-13 18:50:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10427 states, 10426 states have (on average 3.848072127373873) internal successors, (40120), 10426 states have internal predecessors, (40120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10427 states to 10427 states and 40120 transitions. [2025-04-13 18:50:51,523 INFO L79 Accepts]: Start accepts. Automaton has 10427 states and 40120 transitions. Word has length 54 [2025-04-13 18:50:51,523 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:51,523 INFO L485 AbstractCegarLoop]: Abstraction has 10427 states and 40120 transitions. [2025-04-13 18:50:51,523 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:51,523 INFO L278 IsEmpty]: Start isEmpty. Operand 10427 states and 40120 transitions. [2025-04-13 18:50:51,542 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:51,542 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:51,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:51,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 18:50:51,542 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 2 more)] === [2025-04-13 18:50:51,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:51,543 INFO L85 PathProgramCache]: Analyzing trace with hash 397404190, now seen corresponding path program 17 times [2025-04-13 18:50:51,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:51,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194910133] [2025-04-13 18:50:51,543 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:50:51,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:51,549 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:51,582 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:51,582 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:50:51,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:52,379 INFO L134 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:50:52,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:52,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194910133] [2025-04-13 18:50:52,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194910133] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:52,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:52,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:52,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786391581] [2025-04-13 18:50:52,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:52,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:52,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:52,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:52,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:52,383 INFO L87 Difference]: Start difference. First operand 10427 states and 40120 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:53,351 INFO L93 Difference]: Finished difference Result 18549 states and 68945 transitions. [2025-04-13 18:50:53,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:50:53,351 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:53,351 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:53,413 INFO L225 Difference]: With dead ends: 18549 [2025-04-13 18:50:53,413 INFO L226 Difference]: Without dead ends: 18471 [2025-04-13 18:50:53,417 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:50:53,418 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 293 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:53,418 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 600 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:50:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18471 states. [2025-04-13 18:50:53,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18471 to 10419. [2025-04-13 18:50:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10419 states, 10418 states have (on average 3.848339412555193) internal successors, (40092), 10418 states have internal predecessors, (40092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10419 states to 10419 states and 40092 transitions. [2025-04-13 18:50:53,718 INFO L79 Accepts]: Start accepts. Automaton has 10419 states and 40092 transitions. Word has length 54 [2025-04-13 18:50:53,718 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:53,718 INFO L485 AbstractCegarLoop]: Abstraction has 10419 states and 40092 transitions. [2025-04-13 18:50:53,719 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:53,719 INFO L278 IsEmpty]: Start isEmpty. Operand 10419 states and 40092 transitions. [2025-04-13 18:50:53,738 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:53,738 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:53,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:50:53,739 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 18:50:53,739 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 2 more)] === [2025-04-13 18:50:53,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:53,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1158050290, now seen corresponding path program 18 times [2025-04-13 18:50:53,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:53,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277575265] [2025-04-13 18:50:53,739 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:50:53,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:53,744 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:53,762 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:53,762 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:50:53,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:54,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:50:54,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:54,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277575265] [2025-04-13 18:50:54,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277575265] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:54,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:54,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:54,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59509766] [2025-04-13 18:50:54,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:54,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:54,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:54,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:54,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:54,637 INFO L87 Difference]: Start difference. First operand 10419 states and 40092 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:55,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:55,521 INFO L93 Difference]: Finished difference Result 19545 states and 72259 transitions. [2025-04-13 18:50:55,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:50:55,521 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:55,521 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:55,582 INFO L225 Difference]: With dead ends: 19545 [2025-04-13 18:50:55,582 INFO L226 Difference]: Without dead ends: 19473 [2025-04-13 18:50:55,588 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:50:55,589 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 316 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:55,589 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 524 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:50:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19473 states. [2025-04-13 18:50:55,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19473 to 10411. [2025-04-13 18:50:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10411 states, 10410 states have (on average 3.8486071085494715) internal successors, (40064), 10410 states have internal predecessors, (40064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10411 states to 10411 states and 40064 transitions. [2025-04-13 18:50:55,837 INFO L79 Accepts]: Start accepts. Automaton has 10411 states and 40064 transitions. Word has length 54 [2025-04-13 18:50:55,837 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:55,837 INFO L485 AbstractCegarLoop]: Abstraction has 10411 states and 40064 transitions. [2025-04-13 18:50:55,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:55,837 INFO L278 IsEmpty]: Start isEmpty. Operand 10411 states and 40064 transitions. [2025-04-13 18:50:55,854 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:55,854 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50: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] [2025-04-13 18:50:55,854 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 18:50:55,854 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 2 more)] === [2025-04-13 18:50:55,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1043934780, now seen corresponding path program 19 times [2025-04-13 18:50:55,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:55,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971019641] [2025-04-13 18:50:55,855 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:50:55,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:55,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:55,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:55,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:50:55,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:56,573 INFO L134 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:50:56,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:56,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971019641] [2025-04-13 18:50:56,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971019641] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:56,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:56,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:56,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076293028] [2025-04-13 18:50:56,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:56,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:56,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:56,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:56,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:56,574 INFO L87 Difference]: Start difference. First operand 10411 states and 40064 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:57,650 INFO L93 Difference]: Finished difference Result 18575 states and 69016 transitions. [2025-04-13 18:50:57,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:50:57,650 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:57,650 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:57,709 INFO L225 Difference]: With dead ends: 18575 [2025-04-13 18:50:57,709 INFO L226 Difference]: Without dead ends: 18439 [2025-04-13 18:50:57,717 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:50:57,717 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 315 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:57,717 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 567 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:50:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18439 states. [2025-04-13 18:50:57,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18439 to 10387. [2025-04-13 18:50:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10387 states, 10386 states have (on average 3.8490275370691314) internal successors, (39976), 10386 states have internal predecessors, (39976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10387 states to 10387 states and 39976 transitions. [2025-04-13 18:50:57,954 INFO L79 Accepts]: Start accepts. Automaton has 10387 states and 39976 transitions. Word has length 54 [2025-04-13 18:50:57,954 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:57,954 INFO L485 AbstractCegarLoop]: Abstraction has 10387 states and 39976 transitions. [2025-04-13 18:50:57,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:57,954 INFO L278 IsEmpty]: Start isEmpty. Operand 10387 states and 39976 transitions. [2025-04-13 18:50:57,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:50:57,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:57,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:57,972 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 18:50:57,973 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 2 more)] === [2025-04-13 18:50:57,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:57,973 INFO L85 PathProgramCache]: Analyzing trace with hash -561565680, now seen corresponding path program 20 times [2025-04-13 18:50:57,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:57,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144016458] [2025-04-13 18:50:57,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:50:57,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:57,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:50:57,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:50:57,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:50:57,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:58,781 INFO L134 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:50:58,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:58,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144016458] [2025-04-13 18:50:58,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144016458] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:50:58,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:50:58,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:50:58,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508924882] [2025-04-13 18:50:58,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:50:58,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:50:58,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:58,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:50:58,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:50:58,782 INFO L87 Difference]: Start difference. First operand 10387 states and 39976 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:59,771 INFO L93 Difference]: Finished difference Result 19585 states and 72355 transitions. [2025-04-13 18:50:59,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:50:59,771 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:50:59,771 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:59,830 INFO L225 Difference]: With dead ends: 19585 [2025-04-13 18:50:59,830 INFO L226 Difference]: Without dead ends: 19425 [2025-04-13 18:50:59,837 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:50:59,837 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 286 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:59,837 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 610 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:50:59,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19425 states. [2025-04-13 18:51:00,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19425 to 10363. [2025-04-13 18:51:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10363 states, 10362 states have (on average 3.8494499131441806) internal successors, (39888), 10362 states have internal predecessors, (39888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10363 states to 10363 states and 39888 transitions. [2025-04-13 18:51:00,102 INFO L79 Accepts]: Start accepts. Automaton has 10363 states and 39888 transitions. Word has length 54 [2025-04-13 18:51:00,102 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:00,102 INFO L485 AbstractCegarLoop]: Abstraction has 10363 states and 39888 transitions. [2025-04-13 18:51:00,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:00,102 INFO L278 IsEmpty]: Start isEmpty. Operand 10363 states and 39888 transitions. [2025-04-13 18:51:00,118 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:00,118 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:00,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:00,118 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 18:51:00,118 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 2 more)] === [2025-04-13 18:51:00,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:00,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1683834306, now seen corresponding path program 21 times [2025-04-13 18:51:00,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:00,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020866869] [2025-04-13 18:51:00,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:00,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:00,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:00,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:00,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:51:00,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:00,750 INFO L134 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:51:00,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:00,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020866869] [2025-04-13 18:51:00,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020866869] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:00,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:00,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:00,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998537962] [2025-04-13 18:51:00,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:00,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:00,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:00,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:00,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:00,751 INFO L87 Difference]: Start difference. First operand 10363 states and 39888 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:01,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:01,653 INFO L93 Difference]: Finished difference Result 18663 states and 69202 transitions. [2025-04-13 18:51:01,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:01,653 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:01,653 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:01,714 INFO L225 Difference]: With dead ends: 18663 [2025-04-13 18:51:01,714 INFO L226 Difference]: Without dead ends: 18599 [2025-04-13 18:51:01,722 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:01,723 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 377 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:01,723 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 561 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:01,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18599 states. [2025-04-13 18:51:02,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18599 to 10375. [2025-04-13 18:51:02,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10375 states, 10374 states have (on average 3.848467322151533) internal successors, (39924), 10374 states have internal predecessors, (39924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10375 states to 10375 states and 39924 transitions. [2025-04-13 18:51:02,069 INFO L79 Accepts]: Start accepts. Automaton has 10375 states and 39924 transitions. Word has length 54 [2025-04-13 18:51:02,070 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:02,070 INFO L485 AbstractCegarLoop]: Abstraction has 10375 states and 39924 transitions. [2025-04-13 18:51:02,070 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:02,070 INFO L278 IsEmpty]: Start isEmpty. Operand 10375 states and 39924 transitions. [2025-04-13 18:51:02,086 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:02,087 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:02,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:02,087 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 18:51:02,087 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 2 more)] === [2025-04-13 18:51:02,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:02,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1016135634, now seen corresponding path program 22 times [2025-04-13 18:51:02,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:02,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52363406] [2025-04-13 18:51:02,088 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:51:02,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:02,092 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:51:02,112 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:02,112 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:51:02,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:02,768 INFO L134 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:51:02,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:02,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52363406] [2025-04-13 18:51:02,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52363406] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:02,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:02,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:02,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982776424] [2025-04-13 18:51:02,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:02,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:02,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:02,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:02,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:02,770 INFO L87 Difference]: Start difference. First operand 10375 states and 39924 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:03,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:03,963 INFO L93 Difference]: Finished difference Result 19695 states and 72624 transitions. [2025-04-13 18:51:03,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:03,963 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:03,963 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:04,033 INFO L225 Difference]: With dead ends: 19695 [2025-04-13 18:51:04,033 INFO L226 Difference]: Without dead ends: 19625 [2025-04-13 18:51:04,041 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:04,042 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 349 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:04,042 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 560 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:51:04,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19625 states. [2025-04-13 18:51:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19625 to 10387. [2025-04-13 18:51:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10387 states, 10386 states have (on average 3.847487001733102) internal successors, (39960), 10386 states have internal predecessors, (39960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10387 states to 10387 states and 39960 transitions. [2025-04-13 18:51:04,359 INFO L79 Accepts]: Start accepts. Automaton has 10387 states and 39960 transitions. Word has length 54 [2025-04-13 18:51:04,359 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:04,359 INFO L485 AbstractCegarLoop]: Abstraction has 10387 states and 39960 transitions. [2025-04-13 18:51:04,359 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:04,359 INFO L278 IsEmpty]: Start isEmpty. Operand 10387 states and 39960 transitions. [2025-04-13 18:51:04,378 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:04,378 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:04,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:04,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 18:51:04,379 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 2 more)] === [2025-04-13 18:51:04,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:04,379 INFO L85 PathProgramCache]: Analyzing trace with hash -714172386, now seen corresponding path program 23 times [2025-04-13 18:51:04,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:04,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756028681] [2025-04-13 18:51:04,379 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:51:04,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:04,383 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:04,401 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:04,402 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:51:04,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:05,184 INFO L134 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:51:05,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:05,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756028681] [2025-04-13 18:51:05,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756028681] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:05,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:05,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:05,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97909315] [2025-04-13 18:51:05,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:05,184 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:05,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:05,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:05,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:05,185 INFO L87 Difference]: Start difference. First operand 10387 states and 39960 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:06,070 INFO L93 Difference]: Finished difference Result 18681 states and 69247 transitions. [2025-04-13 18:51:06,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:06,071 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:06,071 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:06,127 INFO L225 Difference]: With dead ends: 18681 [2025-04-13 18:51:06,127 INFO L226 Difference]: Without dead ends: 18603 [2025-04-13 18:51:06,133 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:06,134 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 378 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:06,134 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 553 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:06,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18603 states. [2025-04-13 18:51:06,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18603 to 10379. [2025-04-13 18:51:06,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10379 states, 10378 states have (on average 3.8481402967816534) internal successors, (39936), 10378 states have internal predecessors, (39936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10379 states to 10379 states and 39936 transitions. [2025-04-13 18:51:06,366 INFO L79 Accepts]: Start accepts. Automaton has 10379 states and 39936 transitions. Word has length 54 [2025-04-13 18:51:06,366 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:06,366 INFO L485 AbstractCegarLoop]: Abstraction has 10379 states and 39936 transitions. [2025-04-13 18:51:06,366 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:06,366 INFO L278 IsEmpty]: Start isEmpty. Operand 10379 states and 39936 transitions. [2025-04-13 18:51:06,382 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:06,382 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:06,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] [2025-04-13 18:51:06,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 18:51:06,382 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 2 more)] === [2025-04-13 18:51:06,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:06,383 INFO L85 PathProgramCache]: Analyzing trace with hash 46473714, now seen corresponding path program 24 times [2025-04-13 18:51:06,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:06,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658288598] [2025-04-13 18:51:06,383 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:51:06,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:06,386 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:06,397 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:06,397 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:51:06,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:07,055 INFO L134 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:51:07,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:07,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658288598] [2025-04-13 18:51:07,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658288598] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:07,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:07,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:07,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935916061] [2025-04-13 18:51:07,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:07,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:07,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:07,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:07,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:07,056 INFO L87 Difference]: Start difference. First operand 10379 states and 39936 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:07,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:07,976 INFO L93 Difference]: Finished difference Result 19681 states and 72575 transitions. [2025-04-13 18:51:07,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:07,977 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:07,977 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:08,039 INFO L225 Difference]: With dead ends: 19681 [2025-04-13 18:51:08,039 INFO L226 Difference]: Without dead ends: 19609 [2025-04-13 18:51:08,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:08,046 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 326 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:08,046 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 581 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:08,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19609 states. [2025-04-13 18:51:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19609 to 10371. [2025-04-13 18:51:08,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10371 states, 10370 states have (on average 3.848794599807136) internal successors, (39912), 10370 states have internal predecessors, (39912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10371 states to 10371 states and 39912 transitions. [2025-04-13 18:51:08,285 INFO L79 Accepts]: Start accepts. Automaton has 10371 states and 39912 transitions. Word has length 54 [2025-04-13 18:51:08,286 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:08,286 INFO L485 AbstractCegarLoop]: Abstraction has 10371 states and 39912 transitions. [2025-04-13 18:51:08,286 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:08,286 INFO L278 IsEmpty]: Start isEmpty. Operand 10371 states and 39912 transitions. [2025-04-13 18:51:08,302 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:08,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:08,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:08,302 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 18:51:08,302 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 2 more)] === [2025-04-13 18:51:08,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:08,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1084216864, now seen corresponding path program 25 times [2025-04-13 18:51:08,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:08,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053718196] [2025-04-13 18:51:08,303 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:51:08,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:08,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:08,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:08,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:08,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:08,950 INFO L134 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:51:08,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:08,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053718196] [2025-04-13 18:51:08,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053718196] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:08,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:08,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:08,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113024877] [2025-04-13 18:51:08,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:08,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:08,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:08,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:08,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:08,951 INFO L87 Difference]: Start difference. First operand 10371 states and 39912 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:09,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:09,925 INFO L93 Difference]: Finished difference Result 18671 states and 69222 transitions. [2025-04-13 18:51:09,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:09,925 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:09,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:09,982 INFO L225 Difference]: With dead ends: 18671 [2025-04-13 18:51:09,983 INFO L226 Difference]: Without dead ends: 18607 [2025-04-13 18:51:09,989 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:09,990 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 301 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:09,990 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 614 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:51:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18607 states. [2025-04-13 18:51:10,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18607 to 10379. [2025-04-13 18:51:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10379 states, 10378 states have (on average 3.847754866062825) internal successors, (39932), 10378 states have internal predecessors, (39932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10379 states to 10379 states and 39932 transitions. [2025-04-13 18:51:10,233 INFO L79 Accepts]: Start accepts. Automaton has 10379 states and 39932 transitions. Word has length 54 [2025-04-13 18:51:10,234 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:10,234 INFO L485 AbstractCegarLoop]: Abstraction has 10379 states and 39932 transitions. [2025-04-13 18:51:10,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:10,234 INFO L278 IsEmpty]: Start isEmpty. Operand 10379 states and 39932 transitions. [2025-04-13 18:51:10,250 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:10,250 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:10,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:10,250 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 18:51:10,250 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 2 more)] === [2025-04-13 18:51:10,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:10,250 INFO L85 PathProgramCache]: Analyzing trace with hash -846879820, now seen corresponding path program 26 times [2025-04-13 18:51:10,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:10,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340018981] [2025-04-13 18:51:10,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:10,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:10,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:10,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:10,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:51:10,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:10,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:10,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340018981] [2025-04-13 18:51:10,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340018981] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:10,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:10,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:10,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613999100] [2025-04-13 18:51:10,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:10,887 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:10,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:10,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:10,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:10,888 INFO L87 Difference]: Start difference. First operand 10379 states and 39932 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:11,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:11,778 INFO L93 Difference]: Finished difference Result 19699 states and 72628 transitions. [2025-04-13 18:51:11,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:11,779 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:11,779 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:11,837 INFO L225 Difference]: With dead ends: 19699 [2025-04-13 18:51:11,837 INFO L226 Difference]: Without dead ends: 19629 [2025-04-13 18:51:11,845 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:11,845 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 345 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:11,845 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 577 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:11,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19629 states. [2025-04-13 18:51:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19629 to 10390. [2025-04-13 18:51:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10390 states, 10389 states have (on average 3.8462797189334874) internal successors, (39959), 10389 states have internal predecessors, (39959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10390 states to 10390 states and 39959 transitions. [2025-04-13 18:51:12,095 INFO L79 Accepts]: Start accepts. Automaton has 10390 states and 39959 transitions. Word has length 54 [2025-04-13 18:51:12,095 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:12,095 INFO L485 AbstractCegarLoop]: Abstraction has 10390 states and 39959 transitions. [2025-04-13 18:51:12,096 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:12,096 INFO L278 IsEmpty]: Start isEmpty. Operand 10390 states and 39959 transitions. [2025-04-13 18:51:12,113 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:12,113 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:12,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:12,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 18:51:12,114 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 2 more)] === [2025-04-13 18:51:12,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:12,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1325764098, now seen corresponding path program 27 times [2025-04-13 18:51:12,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:12,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143881887] [2025-04-13 18:51:12,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:12,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:12,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:12,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:12,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:51:12,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:12,763 INFO L134 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:51:12,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:12,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143881887] [2025-04-13 18:51:12,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143881887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:12,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:12,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:12,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477044426] [2025-04-13 18:51:12,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:12,764 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:12,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:12,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:12,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:12,764 INFO L87 Difference]: Start difference. First operand 10390 states and 39959 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:13,675 INFO L93 Difference]: Finished difference Result 18638 states and 69140 transitions. [2025-04-13 18:51:13,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:13,676 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:13,676 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:13,734 INFO L225 Difference]: With dead ends: 18638 [2025-04-13 18:51:13,734 INFO L226 Difference]: Without dead ends: 18562 [2025-04-13 18:51:13,741 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:13,741 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 311 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:13,742 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 597 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18562 states. [2025-04-13 18:51:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18562 to 10382. [2025-04-13 18:51:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10382 states, 10381 states have (on average 3.846931894807822) internal successors, (39935), 10381 states have internal predecessors, (39935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 39935 transitions. [2025-04-13 18:51:14,087 INFO L79 Accepts]: Start accepts. Automaton has 10382 states and 39935 transitions. Word has length 54 [2025-04-13 18:51:14,087 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:14,087 INFO L485 AbstractCegarLoop]: Abstraction has 10382 states and 39935 transitions. [2025-04-13 18:51:14,087 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:14,087 INFO L278 IsEmpty]: Start isEmpty. Operand 10382 states and 39935 transitions. [2025-04-13 18:51:14,104 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:14,104 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:14,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] [2025-04-13 18:51:14,105 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 18:51:14,105 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 2 more)] === [2025-04-13 18:51:14,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:14,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1038106514, now seen corresponding path program 28 times [2025-04-13 18:51:14,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:14,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624316536] [2025-04-13 18:51:14,106 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:51:14,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:14,109 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:51:14,122 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:14,123 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:51:14,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:14,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:51:14,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:14,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624316536] [2025-04-13 18:51:14,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624316536] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:14,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:14,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:14,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477745326] [2025-04-13 18:51:14,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:14,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:14,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:14,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:14,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:14,735 INFO L87 Difference]: Start difference. First operand 10382 states and 39935 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:15,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:15,783 INFO L93 Difference]: Finished difference Result 19644 states and 72482 transitions. [2025-04-13 18:51:15,783 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:15,783 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:15,783 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:15,846 INFO L225 Difference]: With dead ends: 19644 [2025-04-13 18:51:15,846 INFO L226 Difference]: Without dead ends: 19562 [2025-04-13 18:51:15,851 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:15,851 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 358 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:15,851 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 506 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:15,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19562 states. [2025-04-13 18:51:16,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19562 to 10371. [2025-04-13 18:51:16,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10371 states, 10370 states have (on average 3.848023143683703) internal successors, (39904), 10370 states have internal predecessors, (39904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10371 states to 10371 states and 39904 transitions. [2025-04-13 18:51:16,088 INFO L79 Accepts]: Start accepts. Automaton has 10371 states and 39904 transitions. Word has length 54 [2025-04-13 18:51:16,088 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:16,088 INFO L485 AbstractCegarLoop]: Abstraction has 10371 states and 39904 transitions. [2025-04-13 18:51:16,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:16,088 INFO L278 IsEmpty]: Start isEmpty. Operand 10371 states and 39904 transitions. [2025-04-13 18:51:16,104 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:16,104 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:16,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] [2025-04-13 18:51:16,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 18:51:16,104 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 2 more)] === [2025-04-13 18:51:16,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:16,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1885829120, now seen corresponding path program 29 times [2025-04-13 18:51:16,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:16,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232951871] [2025-04-13 18:51:16,105 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:51:16,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:16,108 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:16,119 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:16,119 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:51:16,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:16,677 INFO L134 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:51:16,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:16,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232951871] [2025-04-13 18:51:16,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232951871] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:16,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:16,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:16,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639006760] [2025-04-13 18:51:16,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:16,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:16,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:16,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:16,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:16,678 INFO L87 Difference]: Start difference. First operand 10371 states and 39904 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:17,580 INFO L93 Difference]: Finished difference Result 18579 states and 68965 transitions. [2025-04-13 18:51:17,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:17,581 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:17,581 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:17,645 INFO L225 Difference]: With dead ends: 18579 [2025-04-13 18:51:17,645 INFO L226 Difference]: Without dead ends: 18509 [2025-04-13 18:51:17,654 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:17,654 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 325 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:17,654 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 570 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:17,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18509 states. [2025-04-13 18:51:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18509 to 10381. [2025-04-13 18:51:17,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10381 states, 10380 states have (on average 3.8467244701348746) internal successors, (39929), 10380 states have internal predecessors, (39929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10381 states to 10381 states and 39929 transitions. [2025-04-13 18:51:17,903 INFO L79 Accepts]: Start accepts. Automaton has 10381 states and 39929 transitions. Word has length 54 [2025-04-13 18:51:17,904 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:17,904 INFO L485 AbstractCegarLoop]: Abstraction has 10381 states and 39929 transitions. [2025-04-13 18:51:17,904 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:17,904 INFO L278 IsEmpty]: Start isEmpty. Operand 10381 states and 39929 transitions. [2025-04-13 18:51:17,921 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:17,921 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:17,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:17,921 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 18:51:17,921 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 2 more)] === [2025-04-13 18:51:17,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:17,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1648492076, now seen corresponding path program 30 times [2025-04-13 18:51:17,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:17,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480647300] [2025-04-13 18:51:17,922 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:51:17,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:17,925 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:17,937 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:17,937 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:51:17,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:18,535 INFO L134 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:51:18,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:18,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480647300] [2025-04-13 18:51:18,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480647300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:18,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:18,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:18,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629455358] [2025-04-13 18:51:18,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:18,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:18,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:18,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:18,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:18,536 INFO L87 Difference]: Start difference. First operand 10381 states and 39929 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:19,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:19,540 INFO L93 Difference]: Finished difference Result 19597 states and 72342 transitions. [2025-04-13 18:51:19,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:19,540 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:19,541 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:19,612 INFO L225 Difference]: With dead ends: 19597 [2025-04-13 18:51:19,612 INFO L226 Difference]: Without dead ends: 19533 [2025-04-13 18:51:19,620 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:19,620 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 314 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:19,621 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 604 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19533 states. [2025-04-13 18:51:19,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19533 to 10389. [2025-04-13 18:51:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10389 states, 10388 states have (on average 3.845687331536388) internal successors, (39949), 10388 states have internal predecessors, (39949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10389 states to 10389 states and 39949 transitions. [2025-04-13 18:51:19,916 INFO L79 Accepts]: Start accepts. Automaton has 10389 states and 39949 transitions. Word has length 54 [2025-04-13 18:51:19,916 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:19,916 INFO L485 AbstractCegarLoop]: Abstraction has 10389 states and 39949 transitions. [2025-04-13 18:51:19,916 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:19,916 INFO L278 IsEmpty]: Start isEmpty. Operand 10389 states and 39949 transitions. [2025-04-13 18:51:19,932 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:19,932 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:19,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] [2025-04-13 18:51:19,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 18:51:19,932 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 2 more)] === [2025-04-13 18:51:19,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:19,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1488562210, now seen corresponding path program 31 times [2025-04-13 18:51:19,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:19,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456435269] [2025-04-13 18:51:19,933 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:51:19,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:19,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:19,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:19,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:19,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:20,568 INFO L134 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:51:20,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:20,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456435269] [2025-04-13 18:51:20,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456435269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:20,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:20,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:20,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139512635] [2025-04-13 18:51:20,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:20,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:20,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:20,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:20,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:20,569 INFO L87 Difference]: Start difference. First operand 10389 states and 39949 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:21,414 INFO L93 Difference]: Finished difference Result 18537 states and 68857 transitions. [2025-04-13 18:51:21,415 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:21,415 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:21,415 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:21,471 INFO L225 Difference]: With dead ends: 18537 [2025-04-13 18:51:21,471 INFO L226 Difference]: Without dead ends: 18455 [2025-04-13 18:51:21,479 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:21,479 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 300 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:21,479 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 574 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:21,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18455 states. [2025-04-13 18:51:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18455 to 10375. [2025-04-13 18:51:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10375 states, 10374 states have (on average 3.8473105841526896) internal successors, (39912), 10374 states have internal predecessors, (39912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10375 states to 10375 states and 39912 transitions. [2025-04-13 18:51:21,706 INFO L79 Accepts]: Start accepts. Automaton has 10375 states and 39912 transitions. Word has length 54 [2025-04-13 18:51:21,707 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:21,707 INFO L485 AbstractCegarLoop]: Abstraction has 10375 states and 39912 transitions. [2025-04-13 18:51:21,707 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:21,707 INFO L278 IsEmpty]: Start isEmpty. Operand 10375 states and 39912 transitions. [2025-04-13 18:51:21,724 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:21,724 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:21,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:21,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 18:51:21,725 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 2 more)] === [2025-04-13 18:51:21,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:21,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1200904626, now seen corresponding path program 32 times [2025-04-13 18:51:21,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:21,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070345218] [2025-04-13 18:51:21,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:21,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:21,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:21,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:21,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:51:21,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:22,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:51:22,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:22,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070345218] [2025-04-13 18:51:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070345218] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:22,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:22,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:22,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478843172] [2025-04-13 18:51:22,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:22,393 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:22,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:22,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:22,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:22,394 INFO L87 Difference]: Start difference. First operand 10375 states and 39912 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:23,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:23,293 INFO L93 Difference]: Finished difference Result 19542 states and 72203 transitions. [2025-04-13 18:51:23,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:23,293 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:23,293 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:23,351 INFO L225 Difference]: With dead ends: 19542 [2025-04-13 18:51:23,351 INFO L226 Difference]: Without dead ends: 19459 [2025-04-13 18:51:23,358 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:23,358 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 283 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:23,359 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 574 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19459 states. [2025-04-13 18:51:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19459 to 10363. [2025-04-13 18:51:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10363 states, 10362 states have (on average 3.8486778614167148) internal successors, (39880), 10362 states have internal predecessors, (39880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10363 states to 10363 states and 39880 transitions. [2025-04-13 18:51:23,590 INFO L79 Accepts]: Start accepts. Automaton has 10363 states and 39880 transitions. Word has length 54 [2025-04-13 18:51:23,590 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:23,590 INFO L485 AbstractCegarLoop]: Abstraction has 10363 states and 39880 transitions. [2025-04-13 18:51:23,590 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:23,590 INFO L278 IsEmpty]: Start isEmpty. Operand 10363 states and 39880 transitions. [2025-04-13 18:51:23,606 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:23,606 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:23,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:23,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 18:51:23,606 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 2 more)] === [2025-04-13 18:51:23,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:23,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1172526716, now seen corresponding path program 33 times [2025-04-13 18:51:23,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:23,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588127799] [2025-04-13 18:51:23,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:23,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:23,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:23,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:23,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:51:23,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:24,204 INFO L134 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:51:24,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:24,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588127799] [2025-04-13 18:51:24,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588127799] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:24,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:24,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:24,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254734380] [2025-04-13 18:51:24,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:24,205 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:24,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:24,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:24,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:24,205 INFO L87 Difference]: Start difference. First operand 10363 states and 39880 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:25,249 INFO L93 Difference]: Finished difference Result 18643 states and 69165 transitions. [2025-04-13 18:51:25,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:25,250 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:25,250 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:25,311 INFO L225 Difference]: With dead ends: 18643 [2025-04-13 18:51:25,311 INFO L226 Difference]: Without dead ends: 18531 [2025-04-13 18:51:25,316 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:25,317 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 299 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:25,317 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 628 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:51:25,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18531 states. [2025-04-13 18:51:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18531 to 10387. [2025-04-13 18:51:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10387 states, 10386 states have (on average 3.8455613325630655) internal successors, (39940), 10386 states have internal predecessors, (39940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10387 states to 10387 states and 39940 transitions. [2025-04-13 18:51:25,549 INFO L79 Accepts]: Start accepts. Automaton has 10387 states and 39940 transitions. Word has length 54 [2025-04-13 18:51:25,549 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:25,549 INFO L485 AbstractCegarLoop]: Abstraction has 10387 states and 39940 transitions. [2025-04-13 18:51:25,549 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:25,550 INFO L278 IsEmpty]: Start isEmpty. Operand 10387 states and 39940 transitions. [2025-04-13 18:51:25,565 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:25,565 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:25,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:25,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 18:51:25,566 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 2 more)] === [2025-04-13 18:51:25,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:25,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2032848976, now seen corresponding path program 34 times [2025-04-13 18:51:25,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:25,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569241117] [2025-04-13 18:51:25,566 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:51:25,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:25,569 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:51:25,582 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:25,582 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:51:25,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:26,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:51:26,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:26,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569241117] [2025-04-13 18:51:26,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569241117] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:26,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:26,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:26,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933965892] [2025-04-13 18:51:26,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:26,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:26,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:26,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:26,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:26,168 INFO L87 Difference]: Start difference. First operand 10387 states and 39940 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:27,320 INFO L93 Difference]: Finished difference Result 19722 states and 72716 transitions. [2025-04-13 18:51:27,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:27,320 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:27,320 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:27,383 INFO L225 Difference]: With dead ends: 19722 [2025-04-13 18:51:27,383 INFO L226 Difference]: Without dead ends: 19586 [2025-04-13 18:51:27,388 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:27,388 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 303 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:27,389 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 608 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:51:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19586 states. [2025-04-13 18:51:27,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19586 to 10420. [2025-04-13 18:51:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10420 states, 10419 states have (on average 3.8411555811498226) internal successors, (40021), 10419 states have internal predecessors, (40021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10420 states to 10420 states and 40021 transitions. [2025-04-13 18:51:27,627 INFO L79 Accepts]: Start accepts. Automaton has 10420 states and 40021 transitions. Word has length 54 [2025-04-13 18:51:27,627 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:27,627 INFO L485 AbstractCegarLoop]: Abstraction has 10420 states and 40021 transitions. [2025-04-13 18:51:27,627 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:27,627 INFO L278 IsEmpty]: Start isEmpty. Operand 10420 states and 40021 transitions. [2025-04-13 18:51:27,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:27,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:27,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:27,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 18:51:27,645 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 2 more)] === [2025-04-13 18:51:27,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:27,645 INFO L85 PathProgramCache]: Analyzing trace with hash -532942178, now seen corresponding path program 35 times [2025-04-13 18:51:27,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:27,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279595425] [2025-04-13 18:51:27,645 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:51:27,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:27,649 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:27,660 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:27,661 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:51:27,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:28,245 INFO L134 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:51:28,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:28,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279595425] [2025-04-13 18:51:28,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279595425] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:28,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:28,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:28,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581920588] [2025-04-13 18:51:28,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:28,245 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:28,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:28,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:28,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:28,246 INFO L87 Difference]: Start difference. First operand 10420 states and 40021 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:29,305 INFO L93 Difference]: Finished difference Result 18640 states and 69118 transitions. [2025-04-13 18:51:29,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:29,305 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:29,306 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:29,365 INFO L225 Difference]: With dead ends: 18640 [2025-04-13 18:51:29,365 INFO L226 Difference]: Without dead ends: 18576 [2025-04-13 18:51:29,369 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:29,369 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 307 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:29,369 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 622 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:51:29,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18576 states. [2025-04-13 18:51:29,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18576 to 10428. [2025-04-13 18:51:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10428 states, 10427 states have (on average 3.840126594418337) internal successors, (40041), 10427 states have internal predecessors, (40041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10428 states to 10428 states and 40041 transitions. [2025-04-13 18:51:29,602 INFO L79 Accepts]: Start accepts. Automaton has 10428 states and 40041 transitions. Word has length 54 [2025-04-13 18:51:29,602 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:29,602 INFO L485 AbstractCegarLoop]: Abstraction has 10428 states and 40041 transitions. [2025-04-13 18:51:29,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:29,602 INFO L278 IsEmpty]: Start isEmpty. Operand 10428 states and 40041 transitions. [2025-04-13 18:51:29,618 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:29,619 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:29,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:29,619 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 18:51:29,619 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 2 more)] === [2025-04-13 18:51:29,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:29,619 INFO L85 PathProgramCache]: Analyzing trace with hash 327380082, now seen corresponding path program 36 times [2025-04-13 18:51:29,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:29,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525704083] [2025-04-13 18:51:29,619 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:51:29,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:29,623 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:29,633 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:29,633 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:51:29,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:30,270 INFO L134 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:51:30,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:30,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525704083] [2025-04-13 18:51:30,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525704083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:30,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:30,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:30,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333473638] [2025-04-13 18:51:30,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:30,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:30,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:30,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:30,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:30,271 INFO L87 Difference]: Start difference. First operand 10428 states and 40041 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:31,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:31,314 INFO L93 Difference]: Finished difference Result 19676 states and 72548 transitions. [2025-04-13 18:51:31,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:31,314 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:31,314 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:31,376 INFO L225 Difference]: With dead ends: 19676 [2025-04-13 18:51:31,376 INFO L226 Difference]: Without dead ends: 19606 [2025-04-13 18:51:31,381 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:31,381 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 317 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 1541 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:31,381 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 594 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1541 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:51:31,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19606 states. [2025-04-13 18:51:31,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19606 to 10439. [2025-04-13 18:51:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10439 states, 10438 states have (on average 3.838666411189883) internal successors, (40068), 10438 states have internal predecessors, (40068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10439 states to 10439 states and 40068 transitions. [2025-04-13 18:51:31,620 INFO L79 Accepts]: Start accepts. Automaton has 10439 states and 40068 transitions. Word has length 54 [2025-04-13 18:51:31,620 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:31,620 INFO L485 AbstractCegarLoop]: Abstraction has 10439 states and 40068 transitions. [2025-04-13 18:51:31,620 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:31,620 INFO L278 IsEmpty]: Start isEmpty. Operand 10439 states and 40068 transitions. [2025-04-13 18:51:31,637 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:31,637 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:31,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:31,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 18:51:31,638 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 2 more)] === [2025-04-13 18:51:31,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:31,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1352044156, now seen corresponding path program 37 times [2025-04-13 18:51:31,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:31,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83964737] [2025-04-13 18:51:31,638 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:51:31,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:31,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:31,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:31,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:31,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:32,244 INFO L134 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:51:32,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:32,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83964737] [2025-04-13 18:51:32,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83964737] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:32,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:32,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:32,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749964559] [2025-04-13 18:51:32,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:32,245 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:32,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:32,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:32,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:32,245 INFO L87 Difference]: Start difference. First operand 10439 states and 40068 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:33,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:33,294 INFO L93 Difference]: Finished difference Result 18587 states and 68976 transitions. [2025-04-13 18:51:33,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:33,294 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:33,295 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:33,362 INFO L225 Difference]: With dead ends: 18587 [2025-04-13 18:51:33,362 INFO L226 Difference]: Without dead ends: 18475 [2025-04-13 18:51:33,366 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:33,366 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 301 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:33,366 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 575 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18475 states. [2025-04-13 18:51:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18475 to 10395. [2025-04-13 18:51:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10395 states, 10394 states have (on average 3.84298633827208) internal successors, (39944), 10394 states have internal predecessors, (39944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10395 states to 10395 states and 39944 transitions. [2025-04-13 18:51:33,584 INFO L79 Accepts]: Start accepts. Automaton has 10395 states and 39944 transitions. Word has length 54 [2025-04-13 18:51:33,584 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:33,584 INFO L485 AbstractCegarLoop]: Abstraction has 10395 states and 39944 transitions. [2025-04-13 18:51:33,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:33,584 INFO L278 IsEmpty]: Start isEmpty. Operand 10395 states and 39944 transitions. [2025-04-13 18:51:33,600 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:33,601 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:33,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:33,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 18:51:33,601 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 2 more)] === [2025-04-13 18:51:33,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:33,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2082600880, now seen corresponding path program 38 times [2025-04-13 18:51:33,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:33,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227088171] [2025-04-13 18:51:33,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:33,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:33,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:33,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:33,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:51:33,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:34,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:34,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227088171] [2025-04-13 18:51:34,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227088171] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:34,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:34,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:34,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928789294] [2025-04-13 18:51:34,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:34,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:34,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:34,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:34,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:34,208 INFO L87 Difference]: Start difference. First operand 10395 states and 39944 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:35,210 INFO L93 Difference]: Finished difference Result 19562 states and 72235 transitions. [2025-04-13 18:51:35,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:35,211 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:35,211 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:35,272 INFO L225 Difference]: With dead ends: 19562 [2025-04-13 18:51:35,272 INFO L226 Difference]: Without dead ends: 19435 [2025-04-13 18:51:35,275 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:51:35,275 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 310 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:35,276 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 557 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:51:35,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19435 states. [2025-04-13 18:51:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19435 to 10339. [2025-04-13 18:51:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10339 states, 10338 states have (on average 3.849100406268137) internal successors, (39792), 10338 states have internal predecessors, (39792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10339 states to 10339 states and 39792 transitions. [2025-04-13 18:51:35,511 INFO L79 Accepts]: Start accepts. Automaton has 10339 states and 39792 transitions. Word has length 54 [2025-04-13 18:51:35,511 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:35,511 INFO L485 AbstractCegarLoop]: Abstraction has 10339 states and 39792 transitions. [2025-04-13 18:51:35,511 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:35,511 INFO L278 IsEmpty]: Start isEmpty. Operand 10339 states and 39792 transitions. [2025-04-13 18:51:35,527 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:35,528 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:35,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:35,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 18:51:35,528 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 2 more)] === [2025-04-13 18:51:35,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:35,528 INFO L85 PathProgramCache]: Analyzing trace with hash -689515232, now seen corresponding path program 39 times [2025-04-13 18:51:35,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:35,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028778760] [2025-04-13 18:51:35,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:35,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:35,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:35,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:35,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:51:35,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:36,157 INFO L134 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:51:36,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:36,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028778760] [2025-04-13 18:51:36,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028778760] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:36,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:36,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:36,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38222558] [2025-04-13 18:51:36,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:36,158 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:36,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:36,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:36,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:36,158 INFO L87 Difference]: Start difference. First operand 10339 states and 39792 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:37,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:37,296 INFO L93 Difference]: Finished difference Result 18735 states and 69439 transitions. [2025-04-13 18:51:37,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:51:37,296 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:37,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:37,360 INFO L225 Difference]: With dead ends: 18735 [2025-04-13 18:51:37,360 INFO L226 Difference]: Without dead ends: 18671 [2025-04-13 18:51:37,364 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:51:37,364 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 316 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:37,365 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 664 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:51:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18671 states. [2025-04-13 18:51:37,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18671 to 10359. [2025-04-13 18:51:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10359 states, 10358 states have (on average 3.848233249662097) internal successors, (39860), 10358 states have internal predecessors, (39860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10359 states to 10359 states and 39860 transitions. [2025-04-13 18:51:37,675 INFO L79 Accepts]: Start accepts. Automaton has 10359 states and 39860 transitions. Word has length 54 [2025-04-13 18:51:37,675 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:37,675 INFO L485 AbstractCegarLoop]: Abstraction has 10359 states and 39860 transitions. [2025-04-13 18:51:37,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:37,675 INFO L278 IsEmpty]: Start isEmpty. Operand 10359 states and 39860 transitions. [2025-04-13 18:51:37,694 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:37,694 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:37,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] [2025-04-13 18:51:37,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 18:51:37,695 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 2 more)] === [2025-04-13 18:51:37,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:37,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2010454708, now seen corresponding path program 40 times [2025-04-13 18:51:37,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:37,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687028022] [2025-04-13 18:51:37,695 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:51:37,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:37,700 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:51:37,722 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:37,722 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:51:37,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:38,324 INFO L134 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:51:38,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:38,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687028022] [2025-04-13 18:51:38,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687028022] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:38,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:38,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:38,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115977282] [2025-04-13 18:51:38,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:38,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:38,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:38,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:38,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:38,325 INFO L87 Difference]: Start difference. First operand 10359 states and 39860 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:39,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:39,271 INFO L93 Difference]: Finished difference Result 19821 states and 73019 transitions. [2025-04-13 18:51:39,271 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:51:39,272 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:39,272 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:39,333 INFO L225 Difference]: With dead ends: 19821 [2025-04-13 18:51:39,334 INFO L226 Difference]: Without dead ends: 19751 [2025-04-13 18:51:39,341 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:51:39,341 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 308 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:39,341 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 598 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:39,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19751 states. [2025-04-13 18:51:39,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19751 to 10379. [2025-04-13 18:51:39,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10379 states, 10378 states have (on average 3.847369435343997) internal successors, (39928), 10378 states have internal predecessors, (39928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:39,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10379 states to 10379 states and 39928 transitions. [2025-04-13 18:51:39,654 INFO L79 Accepts]: Start accepts. Automaton has 10379 states and 39928 transitions. Word has length 54 [2025-04-13 18:51:39,655 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:39,655 INFO L485 AbstractCegarLoop]: Abstraction has 10379 states and 39928 transitions. [2025-04-13 18:51:39,655 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:39,655 INFO L278 IsEmpty]: Start isEmpty. Operand 10379 states and 39928 transitions. [2025-04-13 18:51:39,672 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:39,672 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:39,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:39,672 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 18:51:39,672 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 2 more)] === [2025-04-13 18:51:39,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:39,673 INFO L85 PathProgramCache]: Analyzing trace with hash 280146688, now seen corresponding path program 41 times [2025-04-13 18:51:39,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:39,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595580745] [2025-04-13 18:51:39,673 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:51:39,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:39,676 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:39,687 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:39,688 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:51:39,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:40,274 INFO L134 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:51:40,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:40,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595580745] [2025-04-13 18:51:40,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595580745] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:40,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:40,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:40,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897654904] [2025-04-13 18:51:40,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:40,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:40,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:40,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:40,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:40,275 INFO L87 Difference]: Start difference. First operand 10379 states and 39928 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:41,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:41,220 INFO L93 Difference]: Finished difference Result 18713 states and 69372 transitions. [2025-04-13 18:51:41,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:51:41,221 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:41,221 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:41,287 INFO L225 Difference]: With dead ends: 18713 [2025-04-13 18:51:41,287 INFO L226 Difference]: Without dead ends: 18635 [2025-04-13 18:51:41,295 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:51:41,295 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 344 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:41,295 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 515 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:41,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18635 states. [2025-04-13 18:51:41,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18635 to 10371. [2025-04-13 18:51:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10371 states, 10370 states have (on average 3.848023143683703) internal successors, (39904), 10370 states have internal predecessors, (39904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10371 states to 10371 states and 39904 transitions. [2025-04-13 18:51:41,556 INFO L79 Accepts]: Start accepts. Automaton has 10371 states and 39904 transitions. Word has length 54 [2025-04-13 18:51:41,557 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:41,557 INFO L485 AbstractCegarLoop]: Abstraction has 10371 states and 39904 transitions. [2025-04-13 18:51:41,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:41,557 INFO L278 IsEmpty]: Start isEmpty. Operand 10371 states and 39904 transitions. [2025-04-13 18:51:41,575 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:41,575 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:41,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:41,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 18:51:41,576 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 2 more)] === [2025-04-13 18:51:41,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:41,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1040792788, now seen corresponding path program 42 times [2025-04-13 18:51:41,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:41,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684312275] [2025-04-13 18:51:41,576 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:51:41,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:41,581 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:41,593 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:41,593 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:51:41,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:42,224 INFO L134 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:51:42,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:42,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684312275] [2025-04-13 18:51:42,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684312275] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:42,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:42,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382693244] [2025-04-13 18:51:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:42,225 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:42,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:42,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:42,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:42,226 INFO L87 Difference]: Start difference. First operand 10371 states and 39904 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:43,147 INFO L93 Difference]: Finished difference Result 19741 states and 72775 transitions. [2025-04-13 18:51:43,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:51:43,148 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:43,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:43,213 INFO L225 Difference]: With dead ends: 19741 [2025-04-13 18:51:43,213 INFO L226 Difference]: Without dead ends: 19669 [2025-04-13 18:51:43,220 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=442, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:51:43,220 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 336 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:43,220 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 550 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19669 states. [2025-04-13 18:51:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19669 to 10363. [2025-04-13 18:51:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10363 states, 10362 states have (on average 3.8486778614167148) internal successors, (39880), 10362 states have internal predecessors, (39880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10363 states to 10363 states and 39880 transitions. [2025-04-13 18:51:43,480 INFO L79 Accepts]: Start accepts. Automaton has 10363 states and 39880 transitions. Word has length 54 [2025-04-13 18:51:43,480 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:43,480 INFO L485 AbstractCegarLoop]: Abstraction has 10363 states and 39880 transitions. [2025-04-13 18:51:43,480 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:43,480 INFO L278 IsEmpty]: Start isEmpty. Operand 10363 states and 39880 transitions. [2025-04-13 18:51:43,499 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:43,499 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:43,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:43,499 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-13 18:51:43,500 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 2 more)] === [2025-04-13 18:51:43,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:43,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2078535938, now seen corresponding path program 43 times [2025-04-13 18:51:43,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:43,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653591001] [2025-04-13 18:51:43,500 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:51:43,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:43,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:43,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:43,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:43,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:44,179 INFO L134 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:51:44,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:44,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653591001] [2025-04-13 18:51:44,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653591001] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:44,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:44,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:44,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879245300] [2025-04-13 18:51:44,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:44,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:44,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:44,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:44,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:44,181 INFO L87 Difference]: Start difference. First operand 10363 states and 39880 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:45,197 INFO L93 Difference]: Finished difference Result 18767 states and 69508 transitions. [2025-04-13 18:51:45,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:51:45,197 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:45,197 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:45,256 INFO L225 Difference]: With dead ends: 18767 [2025-04-13 18:51:45,256 INFO L226 Difference]: Without dead ends: 18703 [2025-04-13 18:51:45,262 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:51:45,263 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 300 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:45,264 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 635 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:51:45,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18703 states. [2025-04-13 18:51:45,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18703 to 10371. [2025-04-13 18:51:45,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10371 states, 10370 states have (on average 3.8476374156219864) internal successors, (39900), 10370 states have internal predecessors, (39900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10371 states to 10371 states and 39900 transitions. [2025-04-13 18:51:45,506 INFO L79 Accepts]: Start accepts. Automaton has 10371 states and 39900 transitions. Word has length 54 [2025-04-13 18:51:45,507 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:45,507 INFO L485 AbstractCegarLoop]: Abstraction has 10371 states and 39900 transitions. [2025-04-13 18:51:45,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:45,507 INFO L278 IsEmpty]: Start isEmpty. Operand 10371 states and 39900 transitions. [2025-04-13 18:51:45,523 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:45,524 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:45,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:45,524 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 18:51:45,524 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 2 more)] === [2025-04-13 18:51:45,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:45,524 INFO L85 PathProgramCache]: Analyzing trace with hash 147439254, now seen corresponding path program 44 times [2025-04-13 18:51:45,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:45,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776213362] [2025-04-13 18:51:45,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:45,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:45,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:45,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:45,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:51:45,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:46,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:46,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776213362] [2025-04-13 18:51:46,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776213362] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:46,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:46,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:46,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636345592] [2025-04-13 18:51:46,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:46,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:46,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:46,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:46,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:46,175 INFO L87 Difference]: Start difference. First operand 10371 states and 39900 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:47,197 INFO L93 Difference]: Finished difference Result 19829 states and 73006 transitions. [2025-04-13 18:51:47,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:51:47,197 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:47,197 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:47,256 INFO L225 Difference]: With dead ends: 19829 [2025-04-13 18:51:47,256 INFO L226 Difference]: Without dead ends: 19759 [2025-04-13 18:51:47,263 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:51:47,263 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 319 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 1647 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:47,263 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 631 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1647 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:51:47,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19759 states. [2025-04-13 18:51:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19759 to 10382. [2025-04-13 18:51:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10382 states, 10381 states have (on average 3.846161256141027) internal successors, (39927), 10381 states have internal predecessors, (39927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 39927 transitions. [2025-04-13 18:51:47,517 INFO L79 Accepts]: Start accepts. Automaton has 10382 states and 39927 transitions. Word has length 54 [2025-04-13 18:51:47,517 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:47,517 INFO L485 AbstractCegarLoop]: Abstraction has 10382 states and 39927 transitions. [2025-04-13 18:51:47,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:47,517 INFO L278 IsEmpty]: Start isEmpty. Operand 10382 states and 39927 transitions. [2025-04-13 18:51:47,534 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:47,534 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:47,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:47,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-13 18:51:47,534 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 2 more)] === [2025-04-13 18:51:47,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:47,534 INFO L85 PathProgramCache]: Analyzing trace with hash -331445024, now seen corresponding path program 45 times [2025-04-13 18:51:47,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:47,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497960720] [2025-04-13 18:51:47,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:47,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:47,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:47,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:47,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:51:47,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:48,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:48,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497960720] [2025-04-13 18:51:48,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497960720] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:48,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:48,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:48,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138662728] [2025-04-13 18:51:48,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:48,125 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:48,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:48,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:48,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:48,126 INFO L87 Difference]: Start difference. First operand 10382 states and 39927 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:49,032 INFO L93 Difference]: Finished difference Result 18734 states and 69426 transitions. [2025-04-13 18:51:49,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:51:49,033 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:49,033 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:49,092 INFO L225 Difference]: With dead ends: 18734 [2025-04-13 18:51:49,092 INFO L226 Difference]: Without dead ends: 18658 [2025-04-13 18:51:49,098 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:51:49,099 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 324 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:49,099 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 551 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:49,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18658 states. [2025-04-13 18:51:49,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18658 to 10374. [2025-04-13 18:51:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10374 states, 10373 states have (on average 3.8468138436325074) internal successors, (39903), 10373 states have internal predecessors, (39903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10374 states to 10374 states and 39903 transitions. [2025-04-13 18:51:49,383 INFO L79 Accepts]: Start accepts. Automaton has 10374 states and 39903 transitions. Word has length 54 [2025-04-13 18:51:49,383 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:49,383 INFO L485 AbstractCegarLoop]: Abstraction has 10374 states and 39903 transitions. [2025-04-13 18:51:49,383 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:49,383 INFO L278 IsEmpty]: Start isEmpty. Operand 10374 states and 39903 transitions. [2025-04-13 18:51:49,399 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:49,399 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:49,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] [2025-04-13 18:51:49,400 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 18:51:49,400 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 2 more)] === [2025-04-13 18:51:49,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:49,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2032425588, now seen corresponding path program 46 times [2025-04-13 18:51:49,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:49,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210665459] [2025-04-13 18:51:49,400 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:51:49,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:49,404 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:51:49,417 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:49,417 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:51:49,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:49,943 INFO L134 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:51:49,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:49,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210665459] [2025-04-13 18:51:49,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210665459] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:49,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:49,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:49,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548956742] [2025-04-13 18:51:49,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:49,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:49,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:49,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:49,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:49,944 INFO L87 Difference]: Start difference. First operand 10374 states and 39903 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:50,785 INFO L93 Difference]: Finished difference Result 19774 states and 72860 transitions. [2025-04-13 18:51:50,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:51:50,785 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:50,785 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:50,847 INFO L225 Difference]: With dead ends: 19774 [2025-04-13 18:51:50,847 INFO L226 Difference]: Without dead ends: 19692 [2025-04-13 18:51:50,854 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:51:50,854 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 329 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:50,854 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 491 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19692 states. [2025-04-13 18:51:51,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19692 to 10363. [2025-04-13 18:51:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10363 states, 10362 states have (on average 3.8479058096892493) internal successors, (39872), 10362 states have internal predecessors, (39872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:51,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10363 states to 10363 states and 39872 transitions. [2025-04-13 18:51:51,100 INFO L79 Accepts]: Start accepts. Automaton has 10363 states and 39872 transitions. Word has length 54 [2025-04-13 18:51:51,100 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:51,100 INFO L485 AbstractCegarLoop]: Abstraction has 10363 states and 39872 transitions. [2025-04-13 18:51:51,100 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:51,101 INFO L278 IsEmpty]: Start isEmpty. Operand 10363 states and 39872 transitions. [2025-04-13 18:51:51,116 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:51,116 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:51,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:51,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-13 18:51:51,117 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 2 more)] === [2025-04-13 18:51:51,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:51,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1414819102, now seen corresponding path program 47 times [2025-04-13 18:51:51,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:51,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239475402] [2025-04-13 18:51:51,117 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:51:51,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:51,120 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:51,131 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:51,132 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:51:51,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:51,739 INFO L134 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:51:51,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:51,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239475402] [2025-04-13 18:51:51,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239475402] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:51,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:51,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:51,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631179159] [2025-04-13 18:51:51,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:51,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:51,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:51,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:51,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:51,740 INFO L87 Difference]: Start difference. First operand 10363 states and 39872 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:52,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:52,646 INFO L93 Difference]: Finished difference Result 18775 states and 69524 transitions. [2025-04-13 18:51:52,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:51:52,646 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:52,646 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:52,706 INFO L225 Difference]: With dead ends: 18775 [2025-04-13 18:51:52,706 INFO L226 Difference]: Without dead ends: 18705 [2025-04-13 18:51:52,713 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:51:52,713 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 322 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:52,713 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 603 Invalid, 1575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18705 states. [2025-04-13 18:51:52,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18705 to 10373. [2025-04-13 18:51:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10373 states, 10372 states have (on average 3.8466062475896643) internal successors, (39897), 10372 states have internal predecessors, (39897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10373 states to 10373 states and 39897 transitions. [2025-04-13 18:51:52,950 INFO L79 Accepts]: Start accepts. Automaton has 10373 states and 39897 transitions. Word has length 54 [2025-04-13 18:51:52,950 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:52,950 INFO L485 AbstractCegarLoop]: Abstraction has 10373 states and 39897 transitions. [2025-04-13 18:51:52,950 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:52,950 INFO L278 IsEmpty]: Start isEmpty. Operand 10373 states and 39897 transitions. [2025-04-13 18:51:52,966 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:52,966 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:52,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:52,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-13 18:51:52,966 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 2 more)] === [2025-04-13 18:51:52,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:52,966 INFO L85 PathProgramCache]: Analyzing trace with hash -654173002, now seen corresponding path program 48 times [2025-04-13 18:51:52,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:52,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371365097] [2025-04-13 18:51:52,967 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:51:52,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:52,970 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:52,980 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:52,980 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:51:52,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:53,613 INFO L134 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:51:53,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:53,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371365097] [2025-04-13 18:51:53,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371365097] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:53,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:53,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:53,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73734523] [2025-04-13 18:51:53,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:53,614 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:53,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:53,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:53,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:53,615 INFO L87 Difference]: Start difference. First operand 10373 states and 39897 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:54,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:54,480 INFO L93 Difference]: Finished difference Result 19822 states and 72976 transitions. [2025-04-13 18:51:54,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:51:54,481 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:54,481 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:54,539 INFO L225 Difference]: With dead ends: 19822 [2025-04-13 18:51:54,539 INFO L226 Difference]: Without dead ends: 19758 [2025-04-13 18:51:54,547 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:51:54,547 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 371 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:54,547 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 515 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19758 states. [2025-04-13 18:51:54,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19758 to 10381. [2025-04-13 18:51:54,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10381 states, 10380 states have (on average 3.8455684007707127) internal successors, (39917), 10380 states have internal predecessors, (39917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10381 states to 10381 states and 39917 transitions. [2025-04-13 18:51:54,794 INFO L79 Accepts]: Start accepts. Automaton has 10381 states and 39917 transitions. Word has length 54 [2025-04-13 18:51:54,794 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:54,794 INFO L485 AbstractCegarLoop]: Abstraction has 10381 states and 39917 transitions. [2025-04-13 18:51:54,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:54,794 INFO L278 IsEmpty]: Start isEmpty. Operand 10381 states and 39917 transitions. [2025-04-13 18:51:54,811 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:54,811 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:54,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:54,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-13 18:51:54,812 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 2 more)] === [2025-04-13 18:51:54,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:54,812 INFO L85 PathProgramCache]: Analyzing trace with hash -494243136, now seen corresponding path program 49 times [2025-04-13 18:51:54,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:54,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562700116] [2025-04-13 18:51:54,812 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:51:54,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:54,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:54,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:54,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:54,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:55,409 INFO L134 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:51:55,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:55,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562700116] [2025-04-13 18:51:55,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562700116] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:55,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:55,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:55,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504148876] [2025-04-13 18:51:55,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:55,409 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:55,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:55,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:55,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:55,410 INFO L87 Difference]: Start difference. First operand 10381 states and 39917 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:56,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:56,371 INFO L93 Difference]: Finished difference Result 18733 states and 69416 transitions. [2025-04-13 18:51:56,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:51:56,372 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:56,372 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:56,430 INFO L225 Difference]: With dead ends: 18733 [2025-04-13 18:51:56,431 INFO L226 Difference]: Without dead ends: 18651 [2025-04-13 18:51:56,437 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:51:56,438 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 306 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:56,438 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 637 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:51:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18651 states. [2025-04-13 18:51:56,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18651 to 10367. [2025-04-13 18:51:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10367 states, 10366 states have (on average 3.847192745514181) internal successors, (39880), 10366 states have internal predecessors, (39880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10367 states to 10367 states and 39880 transitions. [2025-04-13 18:51:56,684 INFO L79 Accepts]: Start accepts. Automaton has 10367 states and 39880 transitions. Word has length 54 [2025-04-13 18:51:56,684 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:56,684 INFO L485 AbstractCegarLoop]: Abstraction has 10367 states and 39880 transitions. [2025-04-13 18:51:56,685 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:56,685 INFO L278 IsEmpty]: Start isEmpty. Operand 10367 states and 39880 transitions. [2025-04-13 18:51:56,702 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:56,703 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:56,703 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:56,703 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 18:51:56,703 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 2 more)] === [2025-04-13 18:51:56,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:56,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2099743596, now seen corresponding path program 50 times [2025-04-13 18:51:56,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:56,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618591308] [2025-04-13 18:51:56,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:56,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:56,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:56,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:56,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:51:56,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:57,341 INFO L134 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:51:57,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:57,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618591308] [2025-04-13 18:51:57,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618591308] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:57,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:57,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:57,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011369115] [2025-04-13 18:51:57,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:57,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:57,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:57,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:57,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:57,342 INFO L87 Difference]: Start difference. First operand 10367 states and 39880 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:58,246 INFO L93 Difference]: Finished difference Result 19767 states and 72837 transitions. [2025-04-13 18:51:58,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:51:58,246 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:51:58,246 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:58,306 INFO L225 Difference]: With dead ends: 19767 [2025-04-13 18:51:58,306 INFO L226 Difference]: Without dead ends: 19684 [2025-04-13 18:51:58,312 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:51:58,313 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 337 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:58,313 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 577 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:51:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19684 states. [2025-04-13 18:51:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19684 to 10355. [2025-04-13 18:51:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10355 states, 10354 states have (on average 3.848560942630867) internal successors, (39848), 10354 states have internal predecessors, (39848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10355 states to 10355 states and 39848 transitions. [2025-04-13 18:51:58,614 INFO L79 Accepts]: Start accepts. Automaton has 10355 states and 39848 transitions. Word has length 54 [2025-04-13 18:51:58,614 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:58,614 INFO L485 AbstractCegarLoop]: Abstraction has 10355 states and 39848 transitions. [2025-04-13 18:51:58,614 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:58,614 INFO L278 IsEmpty]: Start isEmpty. Operand 10355 states and 39848 transitions. [2025-04-13 18:51:58,630 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:51:58,630 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:58,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:58,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-13 18:51:58,630 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 2 more)] === [2025-04-13 18:51:58,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:58,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2061993840, now seen corresponding path program 51 times [2025-04-13 18:51:58,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:58,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069288512] [2025-04-13 18:51:58,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:58,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:58,634 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:51:58,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:51:58,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:51:58,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:59,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:59,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069288512] [2025-04-13 18:51:59,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069288512] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:59,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:59,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:51:59,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099260050] [2025-04-13 18:51:59,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:59,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:51:59,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:59,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:51:59,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:59,208 INFO L87 Difference]: Start difference. First operand 10355 states and 39848 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:00,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:00,163 INFO L93 Difference]: Finished difference Result 18855 states and 69799 transitions. [2025-04-13 18:52:00,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:52:00,164 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:00,164 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:00,224 INFO L225 Difference]: With dead ends: 18855 [2025-04-13 18:52:00,224 INFO L226 Difference]: Without dead ends: 18791 [2025-04-13 18:52:00,231 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=473, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:52:00,231 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 323 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:00,231 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 507 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:00,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18791 states. [2025-04-13 18:52:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18791 to 10379. [2025-04-13 18:52:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10379 states, 10378 states have (on average 3.8469840046251687) internal successors, (39924), 10378 states have internal predecessors, (39924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10379 states to 10379 states and 39924 transitions. [2025-04-13 18:52:00,505 INFO L79 Accepts]: Start accepts. Automaton has 10379 states and 39924 transitions. Word has length 54 [2025-04-13 18:52:00,505 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:00,505 INFO L485 AbstractCegarLoop]: Abstraction has 10379 states and 39924 transitions. [2025-04-13 18:52:00,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:00,505 INFO L278 IsEmpty]: Start isEmpty. Operand 10379 states and 39924 transitions. [2025-04-13 18:52:00,522 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:00,522 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:00,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:00,522 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 18:52:00,522 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 2 more)] === [2025-04-13 18:52:00,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:00,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1201671580, now seen corresponding path program 52 times [2025-04-13 18:52:00,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:00,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977442611] [2025-04-13 18:52:00,523 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:52:00,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:00,526 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:52:00,542 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:00,542 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:52:00,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:01,203 INFO L134 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:52:01,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:01,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977442611] [2025-04-13 18:52:01,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977442611] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:01,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:01,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:01,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289302115] [2025-04-13 18:52:01,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:01,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:01,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:01,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:01,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:01,204 INFO L87 Difference]: Start difference. First operand 10379 states and 39924 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:02,292 INFO L93 Difference]: Finished difference Result 19978 states and 73479 transitions. [2025-04-13 18:52:02,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:52:02,293 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:02,293 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:02,356 INFO L225 Difference]: With dead ends: 19978 [2025-04-13 18:52:02,357 INFO L226 Difference]: Without dead ends: 19908 [2025-04-13 18:52:02,364 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:52:02,365 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 321 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:02,365 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 609 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:52:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19908 states. [2025-04-13 18:52:02,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19908 to 10412. [2025-04-13 18:52:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10412 states, 10411 states have (on average 3.8446835078282584) internal successors, (40027), 10411 states have internal predecessors, (40027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10412 states to 10412 states and 40027 transitions. [2025-04-13 18:52:02,619 INFO L79 Accepts]: Start accepts. Automaton has 10412 states and 40027 transitions. Word has length 54 [2025-04-13 18:52:02,619 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:02,619 INFO L485 AbstractCegarLoop]: Abstraction has 10412 states and 40027 transitions. [2025-04-13 18:52:02,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:02,619 INFO L278 IsEmpty]: Start isEmpty. Operand 10412 states and 40027 transitions. [2025-04-13 18:52:02,635 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:02,635 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:02,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:02,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-13 18:52:02,635 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 2 more)] === [2025-04-13 18:52:02,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:02,635 INFO L85 PathProgramCache]: Analyzing trace with hash -177007506, now seen corresponding path program 53 times [2025-04-13 18:52:02,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:02,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654157756] [2025-04-13 18:52:02,636 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:52:02,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:02,639 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:02,650 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:02,650 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:52:02,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:03,267 INFO L134 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:52:03,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:03,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654157756] [2025-04-13 18:52:03,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654157756] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:03,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:03,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:03,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399766892] [2025-04-13 18:52:03,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:03,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:03,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:03,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:03,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:03,268 INFO L87 Difference]: Start difference. First operand 10412 states and 40027 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:04,263 INFO L93 Difference]: Finished difference Result 18844 states and 69762 transitions. [2025-04-13 18:52:04,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:52:04,264 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:04,264 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:04,322 INFO L225 Difference]: With dead ends: 18844 [2025-04-13 18:52:04,322 INFO L226 Difference]: Without dead ends: 18768 [2025-04-13 18:52:04,329 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:52:04,329 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 286 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:04,329 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 569 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:52:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18768 states. [2025-04-13 18:52:04,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18768 to 10404. [2025-04-13 18:52:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10404 states, 10403 states have (on average 3.8449485725271555) internal successors, (39999), 10403 states have internal predecessors, (39999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10404 states to 10404 states and 39999 transitions. [2025-04-13 18:52:04,562 INFO L79 Accepts]: Start accepts. Automaton has 10404 states and 39999 transitions. Word has length 54 [2025-04-13 18:52:04,562 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:04,562 INFO L485 AbstractCegarLoop]: Abstraction has 10404 states and 39999 transitions. [2025-04-13 18:52:04,563 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:04,563 INFO L278 IsEmpty]: Start isEmpty. Operand 10404 states and 39999 transitions. [2025-04-13 18:52:04,579 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:04,579 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:04,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:04,579 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-13 18:52:04,579 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 2 more)] === [2025-04-13 18:52:04,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:04,579 INFO L85 PathProgramCache]: Analyzing trace with hash 683314754, now seen corresponding path program 54 times [2025-04-13 18:52:04,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:04,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538112673] [2025-04-13 18:52:04,579 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:52:04,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:04,583 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:04,593 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:04,593 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:52:04,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:05,259 INFO L134 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:52:05,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:05,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538112673] [2025-04-13 18:52:05,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538112673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:05,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:05,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:05,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054033895] [2025-04-13 18:52:05,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:05,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:05,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:05,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:05,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:05,261 INFO L87 Difference]: Start difference. First operand 10404 states and 39999 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:06,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:06,164 INFO L93 Difference]: Finished difference Result 19905 states and 73247 transitions. [2025-04-13 18:52:06,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:52:06,165 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:06,165 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:06,224 INFO L225 Difference]: With dead ends: 19905 [2025-04-13 18:52:06,224 INFO L226 Difference]: Without dead ends: 19823 [2025-04-13 18:52:06,231 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=438, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:52:06,231 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 321 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:06,231 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 537 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:06,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19823 states. [2025-04-13 18:52:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19823 to 10393. [2025-04-13 18:52:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10393 states, 10392 states have (on average 3.84536181678214) internal successors, (39961), 10392 states have internal predecessors, (39961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 39961 transitions. [2025-04-13 18:52:06,481 INFO L79 Accepts]: Start accepts. Automaton has 10393 states and 39961 transitions. Word has length 54 [2025-04-13 18:52:06,481 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:06,481 INFO L485 AbstractCegarLoop]: Abstraction has 10393 states and 39961 transitions. [2025-04-13 18:52:06,481 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:06,481 INFO L278 IsEmpty]: Start isEmpty. Operand 10393 states and 39961 transitions. [2025-04-13 18:52:06,497 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:06,497 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:06,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:06,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-04-13 18:52:06,498 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 2 more)] === [2025-04-13 18:52:06,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:06,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1858844416, now seen corresponding path program 55 times [2025-04-13 18:52:06,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:06,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839787401] [2025-04-13 18:52:06,498 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:52:06,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:06,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:06,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:06,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:52:06,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:52:07,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:07,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839787401] [2025-04-13 18:52:07,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839787401] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:07,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:07,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:07,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531353307] [2025-04-13 18:52:07,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:07,088 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:07,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:07,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:07,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:07,088 INFO L87 Difference]: Start difference. First operand 10393 states and 39961 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:08,072 INFO L93 Difference]: Finished difference Result 18797 states and 69643 transitions. [2025-04-13 18:52:08,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:52:08,072 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:08,072 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:08,132 INFO L225 Difference]: With dead ends: 18797 [2025-04-13 18:52:08,132 INFO L226 Difference]: Without dead ends: 18673 [2025-04-13 18:52:08,136 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=437, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:52:08,137 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 294 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:08,137 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 485 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18673 states. [2025-04-13 18:52:08,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18673 to 10377. [2025-04-13 18:52:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10377 states, 10376 states have (on average 3.845894371626831) internal successors, (39905), 10376 states have internal predecessors, (39905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10377 states to 10377 states and 39905 transitions. [2025-04-13 18:52:08,371 INFO L79 Accepts]: Start accepts. Automaton has 10377 states and 39905 transitions. Word has length 54 [2025-04-13 18:52:08,371 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:08,371 INFO L485 AbstractCegarLoop]: Abstraction has 10377 states and 39905 transitions. [2025-04-13 18:52:08,371 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:08,371 INFO L278 IsEmpty]: Start isEmpty. Operand 10377 states and 39905 transitions. [2025-04-13 18:52:08,387 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:08,387 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:08,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:08,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-13 18:52:08,387 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 2 more)] === [2025-04-13 18:52:08,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:08,388 INFO L85 PathProgramCache]: Analyzing trace with hash -998522156, now seen corresponding path program 56 times [2025-04-13 18:52:08,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:08,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064399634] [2025-04-13 18:52:08,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:52:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:08,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:08,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:08,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:52:08,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:08,971 INFO L134 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:52:08,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:08,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064399634] [2025-04-13 18:52:08,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064399634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:08,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:08,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:08,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377104211] [2025-04-13 18:52:08,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:08,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:08,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:08,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:08,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:08,972 INFO L87 Difference]: Start difference. First operand 10377 states and 39905 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:09,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:09,866 INFO L93 Difference]: Finished difference Result 19853 states and 73107 transitions. [2025-04-13 18:52:09,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:52:09,866 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:09,866 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:09,930 INFO L225 Difference]: With dead ends: 19853 [2025-04-13 18:52:09,931 INFO L226 Difference]: Without dead ends: 19714 [2025-04-13 18:52:09,937 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=437, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:52:09,938 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 309 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:09,938 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 549 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19714 states. [2025-04-13 18:52:10,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19714 to 10355. [2025-04-13 18:52:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10355 states, 10354 states have (on average 3.8470156461271006) internal successors, (39832), 10354 states have internal predecessors, (39832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10355 states to 10355 states and 39832 transitions. [2025-04-13 18:52:10,276 INFO L79 Accepts]: Start accepts. Automaton has 10355 states and 39832 transitions. Word has length 54 [2025-04-13 18:52:10,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:10,276 INFO L485 AbstractCegarLoop]: Abstraction has 10355 states and 39832 transitions. [2025-04-13 18:52:10,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:10,276 INFO L278 IsEmpty]: Start isEmpty. Operand 10355 states and 39832 transitions. [2025-04-13 18:52:10,292 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:10,292 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:10,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] [2025-04-13 18:52:10,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-04-13 18:52:10,292 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 2 more)] === [2025-04-13 18:52:10,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:10,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2012155760, now seen corresponding path program 57 times [2025-04-13 18:52:10,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:10,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132259509] [2025-04-13 18:52:10,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:52:10,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:10,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:10,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:10,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:52:10,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:10,852 INFO L134 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:52:10,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:10,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132259509] [2025-04-13 18:52:10,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132259509] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:10,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:10,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:10,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516338037] [2025-04-13 18:52:10,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:10,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:10,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:10,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:10,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:10,853 INFO L87 Difference]: Start difference. First operand 10355 states and 39832 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:11,719 INFO L93 Difference]: Finished difference Result 18595 states and 69022 transitions. [2025-04-13 18:52:11,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:52:11,720 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:11,720 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:11,782 INFO L225 Difference]: With dead ends: 18595 [2025-04-13 18:52:11,782 INFO L226 Difference]: Without dead ends: 18525 [2025-04-13 18:52:11,789 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:52:11,789 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 319 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:11,789 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 571 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18525 states. [2025-04-13 18:52:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18525 to 10385. [2025-04-13 18:52:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10385 states, 10384 states have (on average 3.8450500770416025) internal successors, (39927), 10384 states have internal predecessors, (39927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10385 states to 10385 states and 39927 transitions. [2025-04-13 18:52:12,033 INFO L79 Accepts]: Start accepts. Automaton has 10385 states and 39927 transitions. Word has length 54 [2025-04-13 18:52:12,033 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:12,033 INFO L485 AbstractCegarLoop]: Abstraction has 10385 states and 39927 transitions. [2025-04-13 18:52:12,033 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:12,034 INFO L278 IsEmpty]: Start isEmpty. Operand 10385 states and 39927 transitions. [2025-04-13 18:52:12,049 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:12,050 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:12,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:52:12,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-04-13 18:52:12,050 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 2 more)] === [2025-04-13 18:52:12,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:12,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1251509660, now seen corresponding path program 58 times [2025-04-13 18:52:12,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:12,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904220604] [2025-04-13 18:52:12,050 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:52:12,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:12,053 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:52:12,067 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:12,067 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:52:12,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:12,729 INFO L134 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:52:12,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:12,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904220604] [2025-04-13 18:52:12,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904220604] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:12,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:12,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:12,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043274809] [2025-04-13 18:52:12,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:12,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:12,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:12,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:12,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:12,730 INFO L87 Difference]: Start difference. First operand 10385 states and 39927 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:13,794 INFO L93 Difference]: Finished difference Result 19658 states and 72534 transitions. [2025-04-13 18:52:13,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:52:13,794 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:13,794 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:13,854 INFO L225 Difference]: With dead ends: 19658 [2025-04-13 18:52:13,854 INFO L226 Difference]: Without dead ends: 19594 [2025-04-13 18:52:13,861 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:52:13,861 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 294 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:13,861 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 576 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:52:13,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19594 states. [2025-04-13 18:52:14,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19594 to 10409. [2025-04-13 18:52:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10409 states, 10408 states have (on average 3.8434857801691007) internal successors, (40003), 10408 states have internal predecessors, (40003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:14,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10409 states to 10409 states and 40003 transitions. [2025-04-13 18:52:14,124 INFO L79 Accepts]: Start accepts. Automaton has 10409 states and 40003 transitions. Word has length 54 [2025-04-13 18:52:14,125 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:14,125 INFO L485 AbstractCegarLoop]: Abstraction has 10409 states and 40003 transitions. [2025-04-13 18:52:14,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:14,125 INFO L278 IsEmpty]: Start isEmpty. Operand 10409 states and 40003 transitions. [2025-04-13 18:52:14,141 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:14,142 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:14,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] [2025-04-13 18:52:14,142 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-04-13 18:52:14,142 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 2 more)] === [2025-04-13 18:52:14,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:14,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1091579794, now seen corresponding path program 59 times [2025-04-13 18:52:14,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:14,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578382171] [2025-04-13 18:52:14,142 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:52:14,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:14,146 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:14,157 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:14,157 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:52:14,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:14,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:52:14,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:14,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578382171] [2025-04-13 18:52:14,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578382171] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:14,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:14,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:14,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830652931] [2025-04-13 18:52:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:14,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:14,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:14,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:14,758 INFO L87 Difference]: Start difference. First operand 10409 states and 40003 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:15,586 INFO L93 Difference]: Finished difference Result 18617 states and 69083 transitions. [2025-04-13 18:52:15,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:52:15,586 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:15,586 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:15,646 INFO L225 Difference]: With dead ends: 18617 [2025-04-13 18:52:15,647 INFO L226 Difference]: Without dead ends: 18539 [2025-04-13 18:52:15,653 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:52:15,654 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 317 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:15,654 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 515 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:52:15,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18539 states. [2025-04-13 18:52:15,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18539 to 10399. [2025-04-13 18:52:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10399 states, 10398 states have (on average 3.843816118484324) internal successors, (39968), 10398 states have internal predecessors, (39968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10399 states to 10399 states and 39968 transitions. [2025-04-13 18:52:15,917 INFO L79 Accepts]: Start accepts. Automaton has 10399 states and 39968 transitions. Word has length 54 [2025-04-13 18:52:15,918 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:15,918 INFO L485 AbstractCegarLoop]: Abstraction has 10399 states and 39968 transitions. [2025-04-13 18:52:15,918 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:15,918 INFO L278 IsEmpty]: Start isEmpty. Operand 10399 states and 39968 transitions. [2025-04-13 18:52:15,939 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:15,939 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:15,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:15,939 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-13 18:52:15,939 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 2 more)] === [2025-04-13 18:52:15,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:15,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1597887042, now seen corresponding path program 60 times [2025-04-13 18:52:15,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:15,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363971893] [2025-04-13 18:52:15,940 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:52:15,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:15,944 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:15,957 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:15,957 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:52:15,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:16,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:52:16,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:16,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363971893] [2025-04-13 18:52:16,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363971893] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:16,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:16,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:16,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505059455] [2025-04-13 18:52:16,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:16,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:16,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:16,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:16,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:16,543 INFO L87 Difference]: Start difference. First operand 10399 states and 39968 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:17,465 INFO L93 Difference]: Finished difference Result 19655 states and 72510 transitions. [2025-04-13 18:52:17,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:52:17,466 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:17,466 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:17,529 INFO L225 Difference]: With dead ends: 19655 [2025-04-13 18:52:17,529 INFO L226 Difference]: Without dead ends: 19576 [2025-04-13 18:52:17,536 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:52:17,537 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 309 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:17,537 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 529 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:17,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19576 states. [2025-04-13 18:52:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19576 to 10391. [2025-04-13 18:52:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10391 states, 10390 states have (on average 3.8440808469682386) internal successors, (39940), 10390 states have internal predecessors, (39940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10391 states to 10391 states and 39940 transitions. [2025-04-13 18:52:17,785 INFO L79 Accepts]: Start accepts. Automaton has 10391 states and 39940 transitions. Word has length 54 [2025-04-13 18:52:17,786 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:17,786 INFO L485 AbstractCegarLoop]: Abstraction has 10391 states and 39940 transitions. [2025-04-13 18:52:17,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:17,786 INFO L278 IsEmpty]: Start isEmpty. Operand 10391 states and 39940 transitions. [2025-04-13 18:52:17,802 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:17,802 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:17,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:52:17,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-04-13 18:52:17,802 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 2 more)] === [2025-04-13 18:52:17,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:17,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1684348704, now seen corresponding path program 61 times [2025-04-13 18:52:17,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:17,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322854627] [2025-04-13 18:52:17,803 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:52:17,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:17,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:17,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:17,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:52:17,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:18,401 INFO L134 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:52:18,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:18,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322854627] [2025-04-13 18:52:18,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322854627] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:18,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:18,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:18,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996747476] [2025-04-13 18:52:18,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:18,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:18,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:18,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:18,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:18,402 INFO L87 Difference]: Start difference. First operand 10391 states and 39940 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:19,255 INFO L93 Difference]: Finished difference Result 18571 states and 68967 transitions. [2025-04-13 18:52:19,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:52:19,256 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:19,256 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:19,315 INFO L225 Difference]: With dead ends: 18571 [2025-04-13 18:52:19,315 INFO L226 Difference]: Without dead ends: 18435 [2025-04-13 18:52:19,322 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:52:19,322 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 287 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:19,322 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 552 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18435 states. [2025-04-13 18:52:19,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18435 to 10363. [2025-04-13 18:52:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10363 states, 10362 states have (on average 3.845975680370585) internal successors, (39852), 10362 states have internal predecessors, (39852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10363 states to 10363 states and 39852 transitions. [2025-04-13 18:52:19,647 INFO L79 Accepts]: Start accepts. Automaton has 10363 states and 39852 transitions. Word has length 54 [2025-04-13 18:52:19,647 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:19,648 INFO L485 AbstractCegarLoop]: Abstraction has 10363 states and 39852 transitions. [2025-04-13 18:52:19,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:19,648 INFO L278 IsEmpty]: Start isEmpty. Operand 10363 states and 39852 transitions. [2025-04-13 18:52:19,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:19,665 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:19,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:19,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-04-13 18:52:19,666 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 2 more)] === [2025-04-13 18:52:19,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:19,666 INFO L85 PathProgramCache]: Analyzing trace with hash -246747980, now seen corresponding path program 62 times [2025-04-13 18:52:19,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:19,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642663491] [2025-04-13 18:52:19,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:52:19,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:19,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:19,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:19,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:52:19,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:20,285 INFO L134 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:52:20,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:20,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642663491] [2025-04-13 18:52:20,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642663491] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:20,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:20,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:20,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441086338] [2025-04-13 18:52:20,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:20,286 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:20,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:20,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:20,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:20,286 INFO L87 Difference]: Start difference. First operand 10363 states and 39852 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:21,191 INFO L93 Difference]: Finished difference Result 19594 states and 72348 transitions. [2025-04-13 18:52:21,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:52:21,191 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:21,191 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:21,259 INFO L225 Difference]: With dead ends: 19594 [2025-04-13 18:52:21,259 INFO L226 Difference]: Without dead ends: 19453 [2025-04-13 18:52:21,266 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:52:21,266 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 281 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:21,266 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 580 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:21,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19453 states. [2025-04-13 18:52:21,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19453 to 10339. [2025-04-13 18:52:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10339 states, 10338 states have (on average 3.8475527181272975) internal successors, (39776), 10338 states have internal predecessors, (39776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10339 states to 10339 states and 39776 transitions. [2025-04-13 18:52:21,510 INFO L79 Accepts]: Start accepts. Automaton has 10339 states and 39776 transitions. Word has length 54 [2025-04-13 18:52:21,510 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:21,510 INFO L485 AbstractCegarLoop]: Abstraction has 10339 states and 39776 transitions. [2025-04-13 18:52:21,510 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:21,510 INFO L278 IsEmpty]: Start isEmpty. Operand 10339 states and 39776 transitions. [2025-04-13 18:52:21,526 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:21,526 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:21,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:21,526 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-04-13 18:52:21,527 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 2 more)] === [2025-04-13 18:52:21,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:21,527 INFO L85 PathProgramCache]: Analyzing trace with hash -720444256, now seen corresponding path program 63 times [2025-04-13 18:52:21,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:21,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247642751] [2025-04-13 18:52:21,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:52:21,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:21,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:21,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:21,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:52:21,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:22,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:52:22,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:22,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247642751] [2025-04-13 18:52:22,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247642751] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:22,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:22,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:22,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086027401] [2025-04-13 18:52:22,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:22,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:22,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:22,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:22,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:22,160 INFO L87 Difference]: Start difference. First operand 10339 states and 39776 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:23,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:23,099 INFO L93 Difference]: Finished difference Result 18447 states and 68540 transitions. [2025-04-13 18:52:23,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:23,099 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:23,099 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:23,154 INFO L225 Difference]: With dead ends: 18447 [2025-04-13 18:52:23,154 INFO L226 Difference]: Without dead ends: 18335 [2025-04-13 18:52:23,160 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:23,160 INFO L437 NwaCegarLoop]: 115 mSDtfsCounter, 280 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:23,161 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 595 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:23,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18335 states. [2025-04-13 18:52:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18335 to 10427. [2025-04-13 18:52:23,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10427 states, 10426 states have (on average 3.8415499712257817) internal successors, (40052), 10426 states have internal predecessors, (40052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10427 states to 10427 states and 40052 transitions. [2025-04-13 18:52:23,390 INFO L79 Accepts]: Start accepts. Automaton has 10427 states and 40052 transitions. Word has length 54 [2025-04-13 18:52:23,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:23,390 INFO L485 AbstractCegarLoop]: Abstraction has 10427 states and 40052 transitions. [2025-04-13 18:52:23,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:23,390 INFO L278 IsEmpty]: Start isEmpty. Operand 10427 states and 40052 transitions. [2025-04-13 18:52:23,406 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:23,406 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:23,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:23,407 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-04-13 18:52:23,407 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 2 more)] === [2025-04-13 18:52:23,407 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:23,407 INFO L85 PathProgramCache]: Analyzing trace with hash 774519348, now seen corresponding path program 64 times [2025-04-13 18:52:23,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:23,407 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249776152] [2025-04-13 18:52:23,407 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:52:23,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:23,410 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:52:23,424 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:23,424 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:52:23,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:24,026 INFO L134 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:52:24,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:24,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249776152] [2025-04-13 18:52:24,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249776152] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:24,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:24,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:24,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699772922] [2025-04-13 18:52:24,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:24,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:24,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:24,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:24,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:24,027 INFO L87 Difference]: Start difference. First operand 10427 states and 40052 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:24,995 INFO L93 Difference]: Finished difference Result 19562 states and 72220 transitions. [2025-04-13 18:52:24,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:24,995 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:24,995 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:25,056 INFO L225 Difference]: With dead ends: 19562 [2025-04-13 18:52:25,057 INFO L226 Difference]: Without dead ends: 19426 [2025-04-13 18:52:25,064 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:25,064 INFO L437 NwaCegarLoop]: 115 mSDtfsCounter, 280 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:25,064 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 567 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:52:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19426 states. [2025-04-13 18:52:25,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19426 to 10548. [2025-04-13 18:52:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10548 states, 10547 states have (on average 3.832938276287096) internal successors, (40426), 10547 states have internal predecessors, (40426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10548 states to 10548 states and 40426 transitions. [2025-04-13 18:52:25,312 INFO L79 Accepts]: Start accepts. Automaton has 10548 states and 40426 transitions. Word has length 54 [2025-04-13 18:52:25,312 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:25,312 INFO L485 AbstractCegarLoop]: Abstraction has 10548 states and 40426 transitions. [2025-04-13 18:52:25,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:25,312 INFO L278 IsEmpty]: Start isEmpty. Operand 10548 states and 40426 transitions. [2025-04-13 18:52:25,329 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:25,329 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:25,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:25,329 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-04-13 18:52:25,329 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 2 more)] === [2025-04-13 18:52:25,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:25,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1869054146, now seen corresponding path program 65 times [2025-04-13 18:52:25,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:25,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322526095] [2025-04-13 18:52:25,330 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:52:25,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:25,333 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:25,344 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:25,344 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:52:25,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:25,928 INFO L134 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:52:25,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:25,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322526095] [2025-04-13 18:52:25,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322526095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:25,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:25,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:25,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794411014] [2025-04-13 18:52:25,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:25,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:25,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:25,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:25,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:25,930 INFO L87 Difference]: Start difference. First operand 10548 states and 40426 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:26,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:26,884 INFO L93 Difference]: Finished difference Result 18596 states and 68947 transitions. [2025-04-13 18:52:26,884 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:26,884 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:26,884 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:26,940 INFO L225 Difference]: With dead ends: 18596 [2025-04-13 18:52:26,940 INFO L226 Difference]: Without dead ends: 18532 [2025-04-13 18:52:26,947 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:26,949 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 300 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:26,949 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 552 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:26,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18532 states. [2025-04-13 18:52:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18532 to 10556. [2025-04-13 18:52:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10556 states, 10555 states have (on average 3.831927996210327) internal successors, (40446), 10555 states have internal predecessors, (40446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 40446 transitions. [2025-04-13 18:52:27,217 INFO L79 Accepts]: Start accepts. Automaton has 10556 states and 40446 transitions. Word has length 54 [2025-04-13 18:52:27,217 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:27,217 INFO L485 AbstractCegarLoop]: Abstraction has 10556 states and 40446 transitions. [2025-04-13 18:52:27,217 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:27,217 INFO L278 IsEmpty]: Start isEmpty. Operand 10556 states and 40446 transitions. [2025-04-13 18:52:27,234 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:27,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:27,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:27,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-04-13 18:52:27,234 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 2 more)] === [2025-04-13 18:52:27,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:27,234 INFO L85 PathProgramCache]: Analyzing trace with hash -930949546, now seen corresponding path program 66 times [2025-04-13 18:52:27,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:27,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004003776] [2025-04-13 18:52:27,234 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:52:27,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:27,238 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:27,250 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:27,251 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:52:27,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:27,843 INFO L134 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:52:27,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:27,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004003776] [2025-04-13 18:52:27,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004003776] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:27,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:27,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:27,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455638329] [2025-04-13 18:52:27,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:27,844 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:27,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:27,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:27,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:27,844 INFO L87 Difference]: Start difference. First operand 10556 states and 40446 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:28,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:28,746 INFO L93 Difference]: Finished difference Result 19586 states and 72230 transitions. [2025-04-13 18:52:28,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:28,747 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:28,747 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:28,811 INFO L225 Difference]: With dead ends: 19586 [2025-04-13 18:52:28,811 INFO L226 Difference]: Without dead ends: 19516 [2025-04-13 18:52:28,818 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:28,818 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 323 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:28,818 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 528 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19516 states. [2025-04-13 18:52:29,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19516 to 10567. [2025-04-13 18:52:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10567 states, 10566 states have (on average 3.8304940374787053) internal successors, (40473), 10566 states have internal predecessors, (40473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10567 states to 10567 states and 40473 transitions. [2025-04-13 18:52:29,119 INFO L79 Accepts]: Start accepts. Automaton has 10567 states and 40473 transitions. Word has length 54 [2025-04-13 18:52:29,119 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:29,120 INFO L485 AbstractCegarLoop]: Abstraction has 10567 states and 40473 transitions. [2025-04-13 18:52:29,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:29,120 INFO L278 IsEmpty]: Start isEmpty. Operand 10567 states and 40473 transitions. [2025-04-13 18:52:29,135 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:29,135 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:29,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:29,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-04-13 18:52:29,136 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 2 more)] === [2025-04-13 18:52:29,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:29,136 INFO L85 PathProgramCache]: Analyzing trace with hash -540926816, now seen corresponding path program 67 times [2025-04-13 18:52:29,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:29,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124593175] [2025-04-13 18:52:29,136 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:52:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:29,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:29,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:29,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:52:29,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:29,731 INFO L134 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:52:29,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:29,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124593175] [2025-04-13 18:52:29,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124593175] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:29,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:29,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:29,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36389382] [2025-04-13 18:52:29,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:29,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:29,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:29,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:29,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:29,732 INFO L87 Difference]: Start difference. First operand 10567 states and 40473 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:30,622 INFO L93 Difference]: Finished difference Result 18543 states and 68805 transitions. [2025-04-13 18:52:30,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:30,622 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:30,623 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:30,681 INFO L225 Difference]: With dead ends: 18543 [2025-04-13 18:52:30,681 INFO L226 Difference]: Without dead ends: 18443 [2025-04-13 18:52:30,687 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:30,687 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 288 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:30,687 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 521 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18443 states. [2025-04-13 18:52:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18443 to 10535. [2025-04-13 18:52:30,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10535 states, 10534 states have (on average 3.8322574520599963) internal successors, (40369), 10534 states have internal predecessors, (40369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10535 states to 10535 states and 40369 transitions. [2025-04-13 18:52:30,915 INFO L79 Accepts]: Start accepts. Automaton has 10535 states and 40369 transitions. Word has length 54 [2025-04-13 18:52:30,915 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:30,915 INFO L485 AbstractCegarLoop]: Abstraction has 10535 states and 40369 transitions. [2025-04-13 18:52:30,915 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:30,915 INFO L278 IsEmpty]: Start isEmpty. Operand 10535 states and 40369 transitions. [2025-04-13 18:52:30,931 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:30,931 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:30,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:30,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-04-13 18:52:30,931 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 2 more)] === [2025-04-13 18:52:30,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash 954036788, now seen corresponding path program 68 times [2025-04-13 18:52:30,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:30,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369562299] [2025-04-13 18:52:30,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:52:30,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:30,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:30,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:30,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:52:30,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:31,553 INFO L134 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:52:31,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:31,553 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369562299] [2025-04-13 18:52:31,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369562299] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:31,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:31,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:31,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604266773] [2025-04-13 18:52:31,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:31,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:31,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:31,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:31,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:31,554 INFO L87 Difference]: Start difference. First operand 10535 states and 40369 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:32,441 INFO L93 Difference]: Finished difference Result 19484 states and 71937 transitions. [2025-04-13 18:52:32,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:32,441 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:32,441 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:32,501 INFO L225 Difference]: With dead ends: 19484 [2025-04-13 18:52:32,501 INFO L226 Difference]: Without dead ends: 19369 [2025-04-13 18:52:32,508 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:32,508 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 301 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:32,509 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 529 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:32,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19369 states. [2025-04-13 18:52:32,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19369 to 10491. [2025-04-13 18:52:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10491 states, 10490 states have (on average 3.83489037178265) internal successors, (40228), 10490 states have internal predecessors, (40228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10491 states to 10491 states and 40228 transitions. [2025-04-13 18:52:32,752 INFO L79 Accepts]: Start accepts. Automaton has 10491 states and 40228 transitions. Word has length 54 [2025-04-13 18:52:32,752 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:32,752 INFO L485 AbstractCegarLoop]: Abstraction has 10491 states and 40228 transitions. [2025-04-13 18:52:32,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:32,752 INFO L278 IsEmpty]: Start isEmpty. Operand 10491 states and 40228 transitions. [2025-04-13 18:52:32,769 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:32,769 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:32,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:32,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-04-13 18:52:32,769 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 2 more)] === [2025-04-13 18:52:32,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:32,769 INFO L85 PathProgramCache]: Analyzing trace with hash -654316590, now seen corresponding path program 69 times [2025-04-13 18:52:32,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:32,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498673181] [2025-04-13 18:52:32,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:52:32,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:32,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:32,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:32,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:52:32,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:33,404 INFO L134 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:52:33,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:33,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498673181] [2025-04-13 18:52:33,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498673181] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:33,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:33,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:33,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992403895] [2025-04-13 18:52:33,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:33,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:33,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:33,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:33,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:33,405 INFO L87 Difference]: Start difference. First operand 10491 states and 40228 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:34,331 INFO L93 Difference]: Finished difference Result 18487 states and 68620 transitions. [2025-04-13 18:52:34,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:34,332 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:34,332 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:34,390 INFO L225 Difference]: With dead ends: 18487 [2025-04-13 18:52:34,390 INFO L226 Difference]: Without dead ends: 18423 [2025-04-13 18:52:34,396 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:34,397 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 284 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:34,397 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 567 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:34,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18423 states. [2025-04-13 18:52:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18423 to 10515. [2025-04-13 18:52:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10515 states, 10514 states have (on average 3.833365037093399) internal successors, (40304), 10514 states have internal predecessors, (40304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10515 states to 10515 states and 40304 transitions. [2025-04-13 18:52:34,635 INFO L79 Accepts]: Start accepts. Automaton has 10515 states and 40304 transitions. Word has length 54 [2025-04-13 18:52:34,635 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:34,635 INFO L485 AbstractCegarLoop]: Abstraction has 10515 states and 40304 transitions. [2025-04-13 18:52:34,635 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:34,635 INFO L278 IsEmpty]: Start isEmpty. Operand 10515 states and 40304 transitions. [2025-04-13 18:52:34,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:34,651 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:34,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:34,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-04-13 18:52:34,651 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 2 more)] === [2025-04-13 18:52:34,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash 840647014, now seen corresponding path program 70 times [2025-04-13 18:52:34,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:34,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839850879] [2025-04-13 18:52:34,652 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:52:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:34,655 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:52:34,668 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:34,668 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:52:34,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:35,278 INFO L134 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:52:35,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:35,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839850879] [2025-04-13 18:52:35,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839850879] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:35,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:35,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:35,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484683263] [2025-04-13 18:52:35,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:35,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:35,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:35,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:35,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:35,279 INFO L87 Difference]: Start difference. First operand 10515 states and 40304 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:36,252 INFO L93 Difference]: Finished difference Result 19487 states and 71939 transitions. [2025-04-13 18:52:36,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:36,252 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:36,252 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:36,313 INFO L225 Difference]: With dead ends: 19487 [2025-04-13 18:52:36,313 INFO L226 Difference]: Without dead ends: 19417 [2025-04-13 18:52:36,322 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:36,323 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 339 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:36,323 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 483 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:52:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19417 states. [2025-04-13 18:52:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19417 to 10548. [2025-04-13 18:52:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10548 states, 10547 states have (on average 3.831136816156253) internal successors, (40407), 10547 states have internal predecessors, (40407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10548 states to 10548 states and 40407 transitions. [2025-04-13 18:52:36,585 INFO L79 Accepts]: Start accepts. Automaton has 10548 states and 40407 transitions. Word has length 54 [2025-04-13 18:52:36,585 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:36,585 INFO L485 AbstractCegarLoop]: Abstraction has 10548 states and 40407 transitions. [2025-04-13 18:52:36,585 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:36,586 INFO L278 IsEmpty]: Start isEmpty. Operand 10548 states and 40407 transitions. [2025-04-13 18:52:36,602 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:36,602 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:36,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:36,602 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-04-13 18:52:36,602 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 2 more)] === [2025-04-13 18:52:36,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:36,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1230669744, now seen corresponding path program 71 times [2025-04-13 18:52:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:36,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655702116] [2025-04-13 18:52:36,603 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:52:36,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:36,606 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:36,617 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:36,617 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:52:36,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:37,199 INFO L134 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:52:37,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:37,199 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655702116] [2025-04-13 18:52:37,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655702116] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:37,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:37,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:37,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65646965] [2025-04-13 18:52:37,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:37,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:37,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:37,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:37,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:37,200 INFO L87 Difference]: Start difference. First operand 10548 states and 40407 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:38,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:38,091 INFO L93 Difference]: Finished difference Result 18524 states and 68727 transitions. [2025-04-13 18:52:38,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:38,091 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:38,091 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:38,152 INFO L225 Difference]: With dead ends: 18524 [2025-04-13 18:52:38,153 INFO L226 Difference]: Without dead ends: 18448 [2025-04-13 18:52:38,159 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:38,159 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 292 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:38,159 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 491 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:38,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18448 states. [2025-04-13 18:52:38,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18448 to 10540. [2025-04-13 18:52:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10540 states, 10539 states have (on average 3.831388177246418) internal successors, (40379), 10539 states have internal predecessors, (40379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10540 states to 10540 states and 40379 transitions. [2025-04-13 18:52:38,467 INFO L79 Accepts]: Start accepts. Automaton has 10540 states and 40379 transitions. Word has length 54 [2025-04-13 18:52:38,467 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:38,467 INFO L485 AbstractCegarLoop]: Abstraction has 10540 states and 40379 transitions. [2025-04-13 18:52:38,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:38,467 INFO L278 IsEmpty]: Start isEmpty. Operand 10540 states and 40379 transitions. [2025-04-13 18:52:38,483 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:38,483 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:38,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] [2025-04-13 18:52:38,483 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-04-13 18:52:38,483 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 2 more)] === [2025-04-13 18:52:38,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:38,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1569333948, now seen corresponding path program 72 times [2025-04-13 18:52:38,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:38,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79763506] [2025-04-13 18:52:38,484 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:52:38,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:38,487 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:38,497 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:38,497 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:52:38,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:39,116 INFO L134 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:52:39,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:39,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79763506] [2025-04-13 18:52:39,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79763506] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:39,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:39,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:39,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679220485] [2025-04-13 18:52:39,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:39,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:39,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:39,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:39,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:39,117 INFO L87 Difference]: Start difference. First operand 10540 states and 40379 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:40,029 INFO L93 Difference]: Finished difference Result 19480 states and 71902 transitions. [2025-04-13 18:52:40,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:40,029 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:40,030 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:40,093 INFO L225 Difference]: With dead ends: 19480 [2025-04-13 18:52:40,094 INFO L226 Difference]: Without dead ends: 19398 [2025-04-13 18:52:40,100 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:40,101 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 311 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:40,101 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 522 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:40,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19398 states. [2025-04-13 18:52:40,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19398 to 10529. [2025-04-13 18:52:40,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10529 states, 10528 states have (on average 3.831781914893617) internal successors, (40341), 10528 states have internal predecessors, (40341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10529 states to 10529 states and 40341 transitions. [2025-04-13 18:52:40,346 INFO L79 Accepts]: Start accepts. Automaton has 10529 states and 40341 transitions. Word has length 54 [2025-04-13 18:52:40,346 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:40,346 INFO L485 AbstractCegarLoop]: Abstraction has 10529 states and 40341 transitions. [2025-04-13 18:52:40,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:40,346 INFO L278 IsEmpty]: Start isEmpty. Operand 10529 states and 40341 transitions. [2025-04-13 18:52:40,362 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:40,362 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:40,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:40,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-04-13 18:52:40,362 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 2 more)] === [2025-04-13 18:52:40,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:40,363 INFO L85 PathProgramCache]: Analyzing trace with hash -451167166, now seen corresponding path program 73 times [2025-04-13 18:52:40,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:40,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485945976] [2025-04-13 18:52:40,363 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:52:40,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:40,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:40,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:40,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:52:40,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:41,011 INFO L134 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:52:41,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:41,011 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485945976] [2025-04-13 18:52:41,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485945976] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:41,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:41,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:41,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751436103] [2025-04-13 18:52:41,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:41,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:41,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:41,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:41,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:41,012 INFO L87 Difference]: Start difference. First operand 10529 states and 40341 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:41,958 INFO L93 Difference]: Finished difference Result 18437 states and 68488 transitions. [2025-04-13 18:52:41,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:52:41,958 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:41,958 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:42,014 INFO L225 Difference]: With dead ends: 18437 [2025-04-13 18:52:42,014 INFO L226 Difference]: Without dead ends: 18193 [2025-04-13 18:52:42,021 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:42,021 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 276 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:42,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 521 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18193 states. [2025-04-13 18:52:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18193 to 10393. [2025-04-13 18:52:42,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10393 states, 10392 states have (on average 3.840742879137798) internal successors, (39913), 10392 states have internal predecessors, (39913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 39913 transitions. [2025-04-13 18:52:42,263 INFO L79 Accepts]: Start accepts. Automaton has 10393 states and 39913 transitions. Word has length 54 [2025-04-13 18:52:42,263 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:42,263 INFO L485 AbstractCegarLoop]: Abstraction has 10393 states and 39913 transitions. [2025-04-13 18:52:42,263 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:42,263 INFO L278 IsEmpty]: Start isEmpty. Operand 10393 states and 39913 transitions. [2025-04-13 18:52:42,280 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:42,280 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:42,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:42,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-04-13 18:52:42,280 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 2 more)] === [2025-04-13 18:52:42,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:42,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1043796438, now seen corresponding path program 74 times [2025-04-13 18:52:42,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:42,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224137200] [2025-04-13 18:52:42,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:52:42,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:42,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:42,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:42,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:52:42,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52: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:52:42,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:42,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224137200] [2025-04-13 18:52:42,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224137200] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:42,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:42,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:42,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483174200] [2025-04-13 18:52:42,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:42,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:42,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:42,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:42,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:42,921 INFO L87 Difference]: Start difference. First operand 10393 states and 39913 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:43,866 INFO L93 Difference]: Finished difference Result 19262 states and 71256 transitions. [2025-04-13 18:52:43,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:43,866 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:43,866 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:43,927 INFO L225 Difference]: With dead ends: 19262 [2025-04-13 18:52:43,927 INFO L226 Difference]: Without dead ends: 18971 [2025-04-13 18:52:43,934 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:43,935 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 288 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:43,935 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 551 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18971 states. [2025-04-13 18:52:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18971 to 10219. [2025-04-13 18:52:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10219 states, 10218 states have (on average 3.8535917009199454) internal successors, (39376), 10218 states have internal predecessors, (39376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10219 states to 10219 states and 39376 transitions. [2025-04-13 18:52:44,176 INFO L79 Accepts]: Start accepts. Automaton has 10219 states and 39376 transitions. Word has length 54 [2025-04-13 18:52:44,176 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:44,176 INFO L485 AbstractCegarLoop]: Abstraction has 10219 states and 39376 transitions. [2025-04-13 18:52:44,176 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:44,176 INFO L278 IsEmpty]: Start isEmpty. Operand 10219 states and 39376 transitions. [2025-04-13 18:52:44,191 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:44,192 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:44,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:44,192 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-04-13 18:52:44,192 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 2 more)] === [2025-04-13 18:52:44,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:44,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1908798680, now seen corresponding path program 75 times [2025-04-13 18:52:44,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:44,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624484424] [2025-04-13 18:52:44,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:52:44,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:44,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:44,206 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:44,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:52:44,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:52:44,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:44,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624484424] [2025-04-13 18:52:44,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624484424] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:44,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:44,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:44,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140674807] [2025-04-13 18:52:44,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:44,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:44,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:44,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:44,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:44,890 INFO L87 Difference]: Start difference. First operand 10219 states and 39376 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:45,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:45,838 INFO L93 Difference]: Finished difference Result 18621 states and 69225 transitions. [2025-04-13 18:52:45,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:45,839 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:45,839 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:45,898 INFO L225 Difference]: With dead ends: 18621 [2025-04-13 18:52:45,899 INFO L226 Difference]: Without dead ends: 18557 [2025-04-13 18:52:45,905 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:45,905 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 294 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:45,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 577 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:52:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18557 states. [2025-04-13 18:52:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18557 to 10455. [2025-04-13 18:52:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10455 states, 10454 states have (on average 3.8500095657164723) internal successors, (40248), 10454 states have internal predecessors, (40248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10455 states to 10455 states and 40248 transitions. [2025-04-13 18:52:46,141 INFO L79 Accepts]: Start accepts. Automaton has 10455 states and 40248 transitions. Word has length 54 [2025-04-13 18:52:46,141 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:46,141 INFO L485 AbstractCegarLoop]: Abstraction has 10455 states and 40248 transitions. [2025-04-13 18:52:46,141 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:46,141 INFO L278 IsEmpty]: Start isEmpty. Operand 10455 states and 40248 transitions. [2025-04-13 18:52:46,157 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:46,157 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:46,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:46,157 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-04-13 18:52:46,157 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 2 more)] === [2025-04-13 18:52:46,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:46,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1707804484, now seen corresponding path program 76 times [2025-04-13 18:52:46,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:46,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040901356] [2025-04-13 18:52:46,158 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:52:46,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:46,161 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:52:46,173 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:46,173 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:52:46,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:46,746 INFO L134 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:52:46,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:46,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040901356] [2025-04-13 18:52:46,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040901356] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:46,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:46,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:46,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6151062] [2025-04-13 18:52:46,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:46,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:46,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:46,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:46,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:46,747 INFO L87 Difference]: Start difference. First operand 10455 states and 40248 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:47,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:47,751 INFO L93 Difference]: Finished difference Result 19702 states and 72963 transitions. [2025-04-13 18:52:47,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:47,751 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:47,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:47,813 INFO L225 Difference]: With dead ends: 19702 [2025-04-13 18:52:47,814 INFO L226 Difference]: Without dead ends: 19632 [2025-04-13 18:52:47,820 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:47,821 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 303 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:47,821 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 557 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:52:47,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19632 states. [2025-04-13 18:52:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19632 to 10691. [2025-04-13 18:52:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10691 states, 10690 states have (on average 3.846585594013096) internal successors, (41120), 10690 states have internal predecessors, (41120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10691 states to 10691 states and 41120 transitions. [2025-04-13 18:52:48,073 INFO L79 Accepts]: Start accepts. Automaton has 10691 states and 41120 transitions. Word has length 54 [2025-04-13 18:52:48,073 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:48,073 INFO L485 AbstractCegarLoop]: Abstraction has 10691 states and 41120 transitions. [2025-04-13 18:52:48,073 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:48,074 INFO L278 IsEmpty]: Start isEmpty. Operand 10691 states and 41120 transitions. [2025-04-13 18:52:48,093 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:48,093 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:48,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:48,093 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-04-13 18:52:48,093 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 2 more)] === [2025-04-13 18:52:48,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:48,094 INFO L85 PathProgramCache]: Analyzing trace with hash -939136760, now seen corresponding path program 77 times [2025-04-13 18:52:48,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:48,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013355057] [2025-04-13 18:52:48,094 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:52:48,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:48,097 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:48,108 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:48,108 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:52:48,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:48,748 INFO L134 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:52:48,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:48,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013355057] [2025-04-13 18:52:48,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013355057] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:48,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:48,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:48,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795980341] [2025-04-13 18:52:48,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:48,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:48,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:48,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:48,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:48,749 INFO L87 Difference]: Start difference. First operand 10691 states and 41120 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:49,690 INFO L93 Difference]: Finished difference Result 18863 states and 70106 transitions. [2025-04-13 18:52:49,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:49,690 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:49,691 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:49,750 INFO L225 Difference]: With dead ends: 18863 [2025-04-13 18:52:49,750 INFO L226 Difference]: Without dead ends: 18785 [2025-04-13 18:52:49,756 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:49,757 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 317 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:49,757 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 560 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18785 states. [2025-04-13 18:52:49,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18785 to 10683. [2025-04-13 18:52:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10683 states, 10682 states have (on average 3.8468451600823816) internal successors, (41092), 10682 states have internal predecessors, (41092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10683 states to 10683 states and 41092 transitions. [2025-04-13 18:52:50,055 INFO L79 Accepts]: Start accepts. Automaton has 10683 states and 41092 transitions. Word has length 54 [2025-04-13 18:52:50,055 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:50,055 INFO L485 AbstractCegarLoop]: Abstraction has 10683 states and 41092 transitions. [2025-04-13 18:52:50,055 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:50,055 INFO L278 IsEmpty]: Start isEmpty. Operand 10683 states and 41092 transitions. [2025-04-13 18:52:50,071 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:50,071 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:50,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:52:50,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-04-13 18:52:50,071 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 2 more)] === [2025-04-13 18:52:50,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:50,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1617500892, now seen corresponding path program 78 times [2025-04-13 18:52:50,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:50,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27803258] [2025-04-13 18:52:50,072 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:52:50,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:50,075 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:50,084 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:50,084 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:52:50,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:50,720 INFO L134 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:52:50,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:50,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27803258] [2025-04-13 18:52:50,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27803258] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:50,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:50,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:50,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859663160] [2025-04-13 18:52:50,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:50,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:50,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:50,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:50,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:50,721 INFO L87 Difference]: Start difference. First operand 10683 states and 41092 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:51,723 INFO L93 Difference]: Finished difference Result 19688 states and 72910 transitions. [2025-04-13 18:52:51,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:51,724 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:51,724 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:51,787 INFO L225 Difference]: With dead ends: 19688 [2025-04-13 18:52:51,788 INFO L226 Difference]: Without dead ends: 19616 [2025-04-13 18:52:51,794 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:51,794 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 291 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:51,794 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 562 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:52:51,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19616 states. [2025-04-13 18:52:51,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19616 to 10675. [2025-04-13 18:52:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10675 states, 10674 states have (on average 3.847105115233277) internal successors, (41064), 10674 states have internal predecessors, (41064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:52,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10675 states to 10675 states and 41064 transitions. [2025-04-13 18:52:52,137 INFO L79 Accepts]: Start accepts. Automaton has 10675 states and 41064 transitions. Word has length 54 [2025-04-13 18:52:52,137 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:52,137 INFO L485 AbstractCegarLoop]: Abstraction has 10675 states and 41064 transitions. [2025-04-13 18:52:52,138 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:52,138 INFO L278 IsEmpty]: Start isEmpty. Operand 10675 states and 41064 transitions. [2025-04-13 18:52:52,154 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:52,154 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:52,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:52,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-04-13 18:52:52,155 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 2 more)] === [2025-04-13 18:52:52,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:52,155 INFO L85 PathProgramCache]: Analyzing trace with hash 666552646, now seen corresponding path program 79 times [2025-04-13 18:52:52,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:52,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012053185] [2025-04-13 18:52:52,155 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:52:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:52,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:52,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:52,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:52:52,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:52,797 INFO L134 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:52:52,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:52,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012053185] [2025-04-13 18:52:52,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012053185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:52,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:52,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:52,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429039259] [2025-04-13 18:52:52,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:52,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:52,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:52,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:52,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:52,798 INFO L87 Difference]: Start difference. First operand 10675 states and 41064 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:53,762 INFO L93 Difference]: Finished difference Result 18777 states and 69872 transitions. [2025-04-13 18:52:53,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:53,762 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:53,762 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:53,821 INFO L225 Difference]: With dead ends: 18777 [2025-04-13 18:52:53,821 INFO L226 Difference]: Without dead ends: 18617 [2025-04-13 18:52:53,827 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:53,828 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 278 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:53,828 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 557 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:52:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18617 states. [2025-04-13 18:52:54,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18617 to 10651. [2025-04-13 18:52:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10651 states, 10650 states have (on average 3.8463849765258216) internal successors, (40964), 10650 states have internal predecessors, (40964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10651 states to 10651 states and 40964 transitions. [2025-04-13 18:52:54,064 INFO L79 Accepts]: Start accepts. Automaton has 10651 states and 40964 transitions. Word has length 54 [2025-04-13 18:52:54,064 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:54,064 INFO L485 AbstractCegarLoop]: Abstraction has 10651 states and 40964 transitions. [2025-04-13 18:52:54,064 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:54,065 INFO L278 IsEmpty]: Start isEmpty. Operand 10651 states and 40964 transitions. [2025-04-13 18:52:54,081 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:54,081 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:54,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:54,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-04-13 18:52:54,081 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 2 more)] === [2025-04-13 18:52:54,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:54,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1061273894, now seen corresponding path program 80 times [2025-04-13 18:52:54,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:54,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805126201] [2025-04-13 18:52:54,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:52:54,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:54,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:54,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:54,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:52:54,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:54,736 INFO L134 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:52:54,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:54,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805126201] [2025-04-13 18:52:54,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805126201] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:54,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:54,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:54,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208128180] [2025-04-13 18:52:54,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:54,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:54,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:54,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:54,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:54,737 INFO L87 Difference]: Start difference. First operand 10651 states and 40964 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:55,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:55,702 INFO L93 Difference]: Finished difference Result 19592 states and 72621 transitions. [2025-04-13 18:52:55,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:55,702 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:55,702 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:55,764 INFO L225 Difference]: With dead ends: 19592 [2025-04-13 18:52:55,764 INFO L226 Difference]: Without dead ends: 19456 [2025-04-13 18:52:55,771 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:55,771 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 266 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:55,771 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 529 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:52:55,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19456 states. [2025-04-13 18:52:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19456 to 10627. [2025-04-13 18:52:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10627 states, 10626 states have (on average 3.8456615847920195) internal successors, (40864), 10626 states have internal predecessors, (40864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10627 states to 10627 states and 40864 transitions. [2025-04-13 18:52:56,015 INFO L79 Accepts]: Start accepts. Automaton has 10627 states and 40864 transitions. Word has length 54 [2025-04-13 18:52:56,015 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:56,015 INFO L485 AbstractCegarLoop]: Abstraction has 10627 states and 40864 transitions. [2025-04-13 18:52:56,016 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:56,016 INFO L278 IsEmpty]: Start isEmpty. Operand 10627 states and 40864 transitions. [2025-04-13 18:52:56,032 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:56,032 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:56,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:56,032 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-04-13 18:52:56,032 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 2 more)] === [2025-04-13 18:52:56,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:56,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1746000568, now seen corresponding path program 81 times [2025-04-13 18:52:56,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:56,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825844994] [2025-04-13 18:52:56,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:52:56,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:56,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:56,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:56,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:52:56,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:56,699 INFO L134 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:52:56,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:56,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825844994] [2025-04-13 18:52:56,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825844994] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:56,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:56,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:56,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89315593] [2025-04-13 18:52:56,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:56,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:56,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:56,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:56,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:56,700 INFO L87 Difference]: Start difference. First operand 10627 states and 40864 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:57,683 INFO L93 Difference]: Finished difference Result 18871 states and 70055 transitions. [2025-04-13 18:52:57,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:57,683 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:57,683 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:57,742 INFO L225 Difference]: With dead ends: 18871 [2025-04-13 18:52:57,742 INFO L226 Difference]: Without dead ends: 18807 [2025-04-13 18:52:57,748 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:57,748 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 306 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:57,749 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 586 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:52:57,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18807 states. [2025-04-13 18:52:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18807 to 10659. [2025-04-13 18:52:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10659 states, 10658 states have (on average 3.843873146931882) internal successors, (40968), 10658 states have internal predecessors, (40968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10659 states to 10659 states and 40968 transitions. [2025-04-13 18:52:57,982 INFO L79 Accepts]: Start accepts. Automaton has 10659 states and 40968 transitions. Word has length 54 [2025-04-13 18:52:57,982 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:57,982 INFO L485 AbstractCegarLoop]: Abstraction has 10659 states and 40968 transitions. [2025-04-13 18:52:57,982 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:57,982 INFO L278 IsEmpty]: Start isEmpty. Operand 10659 states and 40968 transitions. [2025-04-13 18:52:57,999 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:57,999 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:57,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] [2025-04-13 18:52:57,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-04-13 18:52:57,999 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 2 more)] === [2025-04-13 18:52:57,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:58,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1870602596, now seen corresponding path program 82 times [2025-04-13 18:52:58,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:58,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018356548] [2025-04-13 18:52:58,000 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:52:58,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:58,003 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:52:58,014 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:58,014 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:52:58,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:58,642 INFO L134 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:52:58,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:58,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018356548] [2025-04-13 18:52:58,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018356548] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:58,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:58,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:52:58,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290887579] [2025-04-13 18:52:58,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:58,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:52:58,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:58,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:52:58,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:52:58,643 INFO L87 Difference]: Start difference. First operand 10659 states and 40968 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:59,612 INFO L93 Difference]: Finished difference Result 19790 states and 73144 transitions. [2025-04-13 18:52:59,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:52:59,613 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:52:59,613 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:59,675 INFO L225 Difference]: With dead ends: 19790 [2025-04-13 18:52:59,675 INFO L226 Difference]: Without dead ends: 19720 [2025-04-13 18:52:59,682 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:52:59,682 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 303 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:59,683 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 592 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:52:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19720 states. [2025-04-13 18:52:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19720 to 10691. [2025-04-13 18:52:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10691 states, 10690 states have (on average 3.8420954162768943) internal successors, (41072), 10690 states have internal predecessors, (41072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10691 states to 10691 states and 41072 transitions. [2025-04-13 18:52:59,933 INFO L79 Accepts]: Start accepts. Automaton has 10691 states and 41072 transitions. Word has length 54 [2025-04-13 18:52:59,933 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:59,933 INFO L485 AbstractCegarLoop]: Abstraction has 10691 states and 41072 transitions. [2025-04-13 18:52:59,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:59,933 INFO L278 IsEmpty]: Start isEmpty. Operand 10691 states and 41072 transitions. [2025-04-13 18:52:59,949 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:52:59,949 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:59,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:59,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-04-13 18:52:59,950 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 2 more)] === [2025-04-13 18:52:59,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:59,950 INFO L85 PathProgramCache]: Analyzing trace with hash -776338648, now seen corresponding path program 83 times [2025-04-13 18:52:59,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:59,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907825799] [2025-04-13 18:52:59,950 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:52:59,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:59,953 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:52:59,964 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:52:59,965 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:52:59,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:00,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:53:00,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:00,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907825799] [2025-04-13 18:53:00,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907825799] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:00,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:00,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:00,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950483048] [2025-04-13 18:53:00,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:00,614 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:00,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:00,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:00,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:00,615 INFO L87 Difference]: Start difference. First operand 10691 states and 41072 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:01,573 INFO L93 Difference]: Finished difference Result 18839 states and 69990 transitions. [2025-04-13 18:53:01,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:01,573 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:01,573 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:01,643 INFO L225 Difference]: With dead ends: 18839 [2025-04-13 18:53:01,644 INFO L226 Difference]: Without dead ends: 18761 [2025-04-13 18:53:01,652 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:01,652 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 311 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:01,652 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 559 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:01,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18761 states. [2025-04-13 18:53:01,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18761 to 10683. [2025-04-13 18:53:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10683 states, 10682 states have (on average 3.842351619546901) internal successors, (41044), 10682 states have internal predecessors, (41044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10683 states to 10683 states and 41044 transitions. [2025-04-13 18:53:01,888 INFO L79 Accepts]: Start accepts. Automaton has 10683 states and 41044 transitions. Word has length 54 [2025-04-13 18:53:01,888 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:01,888 INFO L485 AbstractCegarLoop]: Abstraction has 10683 states and 41044 transitions. [2025-04-13 18:53:01,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:01,888 INFO L278 IsEmpty]: Start isEmpty. Operand 10683 states and 41044 transitions. [2025-04-13 18:53:01,905 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:01,905 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:01,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:01,905 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-04-13 18:53:01,906 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 2 more)] === [2025-04-13 18:53:01,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:01,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1454702780, now seen corresponding path program 84 times [2025-04-13 18:53:01,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:01,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624555012] [2025-04-13 18:53:01,907 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:53:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:01,910 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:01,919 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:01,919 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:53:01,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:02,574 INFO L134 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:53:02,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:02,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624555012] [2025-04-13 18:53:02,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624555012] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:02,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:02,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:02,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750751181] [2025-04-13 18:53:02,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:02,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:02,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:02,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:02,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:02,575 INFO L87 Difference]: Start difference. First operand 10683 states and 41044 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:03,640 INFO L93 Difference]: Finished difference Result 19712 states and 72930 transitions. [2025-04-13 18:53:03,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:03,641 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:03,641 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:03,703 INFO L225 Difference]: With dead ends: 19712 [2025-04-13 18:53:03,704 INFO L226 Difference]: Without dead ends: 19640 [2025-04-13 18:53:03,707 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:03,707 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 297 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:03,708 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 587 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19640 states. [2025-04-13 18:53:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19640 to 10675. [2025-04-13 18:53:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10675 states, 10674 states have (on average 3.8426082068577854) internal successors, (41016), 10674 states have internal predecessors, (41016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10675 states to 10675 states and 41016 transitions. [2025-04-13 18:53:03,932 INFO L79 Accepts]: Start accepts. Automaton has 10675 states and 41016 transitions. Word has length 54 [2025-04-13 18:53:03,933 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:03,933 INFO L485 AbstractCegarLoop]: Abstraction has 10675 states and 41016 transitions. [2025-04-13 18:53:03,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:03,933 INFO L278 IsEmpty]: Start isEmpty. Operand 10675 states and 41016 transitions. [2025-04-13 18:53:03,949 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:03,949 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:03,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:03,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-04-13 18:53:03,949 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 2 more)] === [2025-04-13 18:53:03,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:03,950 INFO L85 PathProgramCache]: Analyzing trace with hash -129808058, now seen corresponding path program 85 times [2025-04-13 18:53:03,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:03,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017507807] [2025-04-13 18:53:03,950 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:53:03,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:03,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:03,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:03,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:53:03,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:04,575 INFO L134 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:53:04,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:04,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017507807] [2025-04-13 18:53:04,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017507807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:04,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:04,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:04,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111531491] [2025-04-13 18:53:04,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:04,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:04,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:04,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:04,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:04,576 INFO L87 Difference]: Start difference. First operand 10675 states and 41016 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:05,581 INFO L93 Difference]: Finished difference Result 18753 states and 69756 transitions. [2025-04-13 18:53:05,582 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:05,582 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:05,582 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:05,643 INFO L225 Difference]: With dead ends: 18753 [2025-04-13 18:53:05,643 INFO L226 Difference]: Without dead ends: 18545 [2025-04-13 18:53:05,649 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:05,650 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 305 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:05,650 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 523 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18545 states. [2025-04-13 18:53:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18545 to 10579. [2025-04-13 18:53:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10579 states, 10578 states have (on average 3.8453393836263943) internal successors, (40676), 10578 states have internal predecessors, (40676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10579 states to 10579 states and 40676 transitions. [2025-04-13 18:53:05,972 INFO L79 Accepts]: Start accepts. Automaton has 10579 states and 40676 transitions. Word has length 54 [2025-04-13 18:53:05,972 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:05,972 INFO L485 AbstractCegarLoop]: Abstraction has 10579 states and 40676 transitions. [2025-04-13 18:53:05,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:05,973 INFO L278 IsEmpty]: Start isEmpty. Operand 10579 states and 40676 transitions. [2025-04-13 18:53:05,989 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:05,990 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:05,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:05,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-04-13 18:53:05,990 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 2 more)] === [2025-04-13 18:53:05,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:05,990 INFO L85 PathProgramCache]: Analyzing trace with hash -264913190, now seen corresponding path program 86 times [2025-04-13 18:53:05,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:05,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593198185] [2025-04-13 18:53:05,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:53:05,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:05,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:06,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:06,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:53:06,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:06,645 INFO L134 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:53:06,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:06,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593198185] [2025-04-13 18:53:06,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593198185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:06,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:06,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:06,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127203773] [2025-04-13 18:53:06,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:06,646 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:06,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:06,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:06,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:06,646 INFO L87 Difference]: Start difference. First operand 10579 states and 40676 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:07,596 INFO L93 Difference]: Finished difference Result 19544 states and 72401 transitions. [2025-04-13 18:53:07,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:07,597 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:07,597 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:07,662 INFO L225 Difference]: With dead ends: 19544 [2025-04-13 18:53:07,663 INFO L226 Difference]: Without dead ends: 19312 [2025-04-13 18:53:07,669 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:07,670 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 276 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:07,670 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 528 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:53:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19312 states. [2025-04-13 18:53:07,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19312 to 10483. [2025-04-13 18:53:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10483 states, 10482 states have (on average 3.848120587674108) internal successors, (40336), 10482 states have internal predecessors, (40336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:07,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10483 states to 10483 states and 40336 transitions. [2025-04-13 18:53:07,911 INFO L79 Accepts]: Start accepts. Automaton has 10483 states and 40336 transitions. Word has length 54 [2025-04-13 18:53:07,911 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:07,911 INFO L485 AbstractCegarLoop]: Abstraction has 10483 states and 40336 transitions. [2025-04-13 18:53:07,912 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:07,912 INFO L278 IsEmpty]: Start isEmpty. Operand 10483 states and 40336 transitions. [2025-04-13 18:53:07,929 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:07,929 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:07,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:07,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-04-13 18:53:07,929 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 2 more)] === [2025-04-13 18:53:07,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:07,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2007934168, now seen corresponding path program 87 times [2025-04-13 18:53:07,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:07,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850954871] [2025-04-13 18:53:07,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:53:07,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:07,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:07,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:07,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:53:07,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:08,601 INFO L134 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:53:08,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:08,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850954871] [2025-04-13 18:53:08,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850954871] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:08,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:08,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:08,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184668327] [2025-04-13 18:53:08,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:08,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:08,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:08,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:08,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:08,602 INFO L87 Difference]: Start difference. First operand 10483 states and 40336 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:09,511 INFO L93 Difference]: Finished difference Result 18859 states and 69963 transitions. [2025-04-13 18:53:09,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:09,511 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:09,511 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:09,574 INFO L225 Difference]: With dead ends: 18859 [2025-04-13 18:53:09,574 INFO L226 Difference]: Without dead ends: 18795 [2025-04-13 18:53:09,581 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:09,581 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 292 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:09,581 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 572 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:53:09,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18795 states. [2025-04-13 18:53:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18795 to 10527. [2025-04-13 18:53:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10527 states, 10526 states have (on average 3.846475394261828) internal successors, (40488), 10526 states have internal predecessors, (40488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10527 states to 10527 states and 40488 transitions. [2025-04-13 18:53:09,831 INFO L79 Accepts]: Start accepts. Automaton has 10527 states and 40488 transitions. Word has length 54 [2025-04-13 18:53:09,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:09,831 INFO L485 AbstractCegarLoop]: Abstraction has 10527 states and 40488 transitions. [2025-04-13 18:53:09,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:09,831 INFO L278 IsEmpty]: Start isEmpty. Operand 10527 states and 40488 transitions. [2025-04-13 18:53:09,847 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:09,847 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:09,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:09,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-04-13 18:53:09,847 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 2 more)] === [2025-04-13 18:53:09,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:09,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1806939972, now seen corresponding path program 88 times [2025-04-13 18:53:09,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:09,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156682002] [2025-04-13 18:53:09,848 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:53:09,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:09,851 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:53:09,864 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:09,864 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:53:09,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:10,537 INFO L134 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:53:10,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:10,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156682002] [2025-04-13 18:53:10,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156682002] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:10,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:10,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:10,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865505372] [2025-04-13 18:53:10,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:10,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:10,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:10,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:10,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:10,538 INFO L87 Difference]: Start difference. First operand 10527 states and 40488 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:11,605 INFO L93 Difference]: Finished difference Result 19746 states and 72970 transitions. [2025-04-13 18:53:11,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:11,606 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:11,606 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:11,667 INFO L225 Difference]: With dead ends: 19746 [2025-04-13 18:53:11,667 INFO L226 Difference]: Without dead ends: 19676 [2025-04-13 18:53:11,673 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:11,674 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 291 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:11,674 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 533 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:11,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19676 states. [2025-04-13 18:53:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19676 to 10571. [2025-04-13 18:53:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10571 states, 10570 states have (on average 3.8448438978240302) internal successors, (40640), 10570 states have internal predecessors, (40640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10571 states to 10571 states and 40640 transitions. [2025-04-13 18:53:11,915 INFO L79 Accepts]: Start accepts. Automaton has 10571 states and 40640 transitions. Word has length 54 [2025-04-13 18:53:11,916 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:11,916 INFO L485 AbstractCegarLoop]: Abstraction has 10571 states and 40640 transitions. [2025-04-13 18:53:11,916 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:11,916 INFO L278 IsEmpty]: Start isEmpty. Operand 10571 states and 40640 transitions. [2025-04-13 18:53:11,932 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:11,932 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:11,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] [2025-04-13 18:53:11,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-04-13 18:53:11,933 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 2 more)] === [2025-04-13 18:53:11,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:11,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1038272248, now seen corresponding path program 89 times [2025-04-13 18:53:11,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:11,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084025959] [2025-04-13 18:53:11,933 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:53:11,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:11,936 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:11,946 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:11,946 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:53:11,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:12,634 INFO L134 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:53:12,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:12,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084025959] [2025-04-13 18:53:12,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084025959] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:12,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:12,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:12,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031548830] [2025-04-13 18:53:12,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:12,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:12,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:12,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:12,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:12,635 INFO L87 Difference]: Start difference. First operand 10571 states and 40640 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:13,599 INFO L93 Difference]: Finished difference Result 18909 states and 70124 transitions. [2025-04-13 18:53:13,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:13,599 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:13,599 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:13,658 INFO L225 Difference]: With dead ends: 18909 [2025-04-13 18:53:13,658 INFO L226 Difference]: Without dead ends: 18831 [2025-04-13 18:53:13,664 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:13,665 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 298 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:13,665 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 589 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:13,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18831 states. [2025-04-13 18:53:13,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18831 to 10563. [2025-04-13 18:53:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10563 states, 10562 states have (on average 3.8451050937322475) internal successors, (40612), 10562 states have internal predecessors, (40612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10563 states to 10563 states and 40612 transitions. [2025-04-13 18:53:13,900 INFO L79 Accepts]: Start accepts. Automaton has 10563 states and 40612 transitions. Word has length 54 [2025-04-13 18:53:13,900 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:13,900 INFO L485 AbstractCegarLoop]: Abstraction has 10563 states and 40612 transitions. [2025-04-13 18:53:13,900 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:13,900 INFO L278 IsEmpty]: Start isEmpty. Operand 10563 states and 40612 transitions. [2025-04-13 18:53:13,916 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:13,916 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:13,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:13,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-04-13 18:53:13,917 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 2 more)] === [2025-04-13 18:53:13,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:13,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1518365404, now seen corresponding path program 90 times [2025-04-13 18:53:13,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:13,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932286964] [2025-04-13 18:53:13,917 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:53:13,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:13,920 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:13,929 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:13,929 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:53:13,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:14,580 INFO L134 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:53:14,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:14,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932286964] [2025-04-13 18:53:14,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932286964] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:14,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:14,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:14,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259017199] [2025-04-13 18:53:14,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:14,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:14,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:14,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:14,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:14,581 INFO L87 Difference]: Start difference. First operand 10563 states and 40612 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:15,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:15,529 INFO L93 Difference]: Finished difference Result 19732 states and 72917 transitions. [2025-04-13 18:53:15,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:15,529 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:15,529 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:15,592 INFO L225 Difference]: With dead ends: 19732 [2025-04-13 18:53:15,592 INFO L226 Difference]: Without dead ends: 19660 [2025-04-13 18:53:15,600 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:15,600 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 326 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:15,600 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 546 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:15,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19660 states. [2025-04-13 18:53:15,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19660 to 10555. [2025-04-13 18:53:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10555 states, 10554 states have (on average 3.8453666856168276) internal successors, (40584), 10554 states have internal predecessors, (40584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:15,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10555 states to 10555 states and 40584 transitions. [2025-04-13 18:53:15,843 INFO L79 Accepts]: Start accepts. Automaton has 10555 states and 40584 transitions. Word has length 54 [2025-04-13 18:53:15,843 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:15,843 INFO L485 AbstractCegarLoop]: Abstraction has 10555 states and 40584 transitions. [2025-04-13 18:53:15,843 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:15,843 INFO L278 IsEmpty]: Start isEmpty. Operand 10555 states and 40584 transitions. [2025-04-13 18:53:15,859 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:15,859 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:15,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] [2025-04-13 18:53:15,860 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-04-13 18:53:15,860 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 2 more)] === [2025-04-13 18:53:15,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash 567417158, now seen corresponding path program 91 times [2025-04-13 18:53:15,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:15,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366961035] [2025-04-13 18:53:15,860 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:53:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:15,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:15,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:15,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:53:15,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:16,485 INFO L134 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:53:16,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:16,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366961035] [2025-04-13 18:53:16,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366961035] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:16,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:16,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:16,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354798892] [2025-04-13 18:53:16,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:16,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:16,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:16,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:16,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:16,486 INFO L87 Difference]: Start difference. First operand 10555 states and 40584 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:17,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:17,540 INFO L93 Difference]: Finished difference Result 18959 states and 70263 transitions. [2025-04-13 18:53:17,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:17,540 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:17,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:17,600 INFO L225 Difference]: With dead ends: 18959 [2025-04-13 18:53:17,600 INFO L226 Difference]: Without dead ends: 18799 [2025-04-13 18:53:17,605 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:17,605 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 287 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:17,605 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 565 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1620 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18799 states. [2025-04-13 18:53:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18799 to 10531. [2025-04-13 18:53:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10531 states, 10530 states have (on average 3.8457739791073124) internal successors, (40496), 10530 states have internal predecessors, (40496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10531 states to 10531 states and 40496 transitions. [2025-04-13 18:53:17,834 INFO L79 Accepts]: Start accepts. Automaton has 10531 states and 40496 transitions. Word has length 54 [2025-04-13 18:53:17,834 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:17,834 INFO L485 AbstractCegarLoop]: Abstraction has 10531 states and 40496 transitions. [2025-04-13 18:53:17,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:17,834 INFO L278 IsEmpty]: Start isEmpty. Operand 10531 states and 40496 transitions. [2025-04-13 18:53:17,851 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:17,851 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:17,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:17,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-04-13 18:53:17,851 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 2 more)] === [2025-04-13 18:53:17,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:17,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1160409382, now seen corresponding path program 92 times [2025-04-13 18:53:17,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:17,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817481136] [2025-04-13 18:53:17,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:53:17,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:17,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:17,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:17,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:53:17,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:53:18,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:18,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817481136] [2025-04-13 18:53:18,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817481136] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:18,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:18,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:18,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899518437] [2025-04-13 18:53:18,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:18,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:18,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:18,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:18,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:18,487 INFO L87 Difference]: Start difference. First operand 10531 states and 40496 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:19,503 INFO L93 Difference]: Finished difference Result 19748 states and 72945 transitions. [2025-04-13 18:53:19,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:19,503 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:19,504 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:19,568 INFO L225 Difference]: With dead ends: 19748 [2025-04-13 18:53:19,568 INFO L226 Difference]: Without dead ends: 19612 [2025-04-13 18:53:19,576 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:19,577 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 283 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:19,577 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 583 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:19,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19612 states. [2025-04-13 18:53:19,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19612 to 10507. [2025-04-13 18:53:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10507 states, 10506 states have (on average 3.846183133447554) internal successors, (40408), 10506 states have internal predecessors, (40408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10507 states to 10507 states and 40408 transitions. [2025-04-13 18:53:19,884 INFO L79 Accepts]: Start accepts. Automaton has 10507 states and 40408 transitions. Word has length 54 [2025-04-13 18:53:19,885 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:19,885 INFO L485 AbstractCegarLoop]: Abstraction has 10507 states and 40408 transitions. [2025-04-13 18:53:19,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:19,885 INFO L278 IsEmpty]: Start isEmpty. Operand 10507 states and 40408 transitions. [2025-04-13 18:53:19,901 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:19,901 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:19,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:19,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-04-13 18:53:19,901 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 2 more)] === [2025-04-13 18:53:19,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:19,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1871677254, now seen corresponding path program 93 times [2025-04-13 18:53:19,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:19,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450352959] [2025-04-13 18:53:19,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:53:19,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:19,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:19,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:19,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:53:19,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:20,513 INFO L134 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:53:20,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:20,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450352959] [2025-04-13 18:53:20,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450352959] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:20,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:20,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:20,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595693211] [2025-04-13 18:53:20,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:20,514 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:20,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:20,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:20,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:20,514 INFO L87 Difference]: Start difference. First operand 10507 states and 40408 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:21,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:21,400 INFO L93 Difference]: Finished difference Result 18929 states and 70127 transitions. [2025-04-13 18:53:21,401 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:21,401 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:21,401 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:21,461 INFO L225 Difference]: With dead ends: 18929 [2025-04-13 18:53:21,461 INFO L226 Difference]: Without dead ends: 18865 [2025-04-13 18:53:21,468 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:21,468 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 347 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:21,468 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 548 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:53:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18865 states. [2025-04-13 18:53:21,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18865 to 10519. [2025-04-13 18:53:21,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10519 states, 10518 states have (on average 3.8452177220003803) internal successors, (40444), 10518 states have internal predecessors, (40444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10519 states to 10519 states and 40444 transitions. [2025-04-13 18:53:21,694 INFO L79 Accepts]: Start accepts. Automaton has 10519 states and 40444 transitions. Word has length 54 [2025-04-13 18:53:21,694 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:21,694 INFO L485 AbstractCegarLoop]: Abstraction has 10519 states and 40444 transitions. [2025-04-13 18:53:21,694 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:21,695 INFO L278 IsEmpty]: Start isEmpty. Operand 10519 states and 40444 transitions. [2025-04-13 18:53:21,710 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:21,710 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:21,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:21,711 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-04-13 18:53:21,711 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 2 more)] === [2025-04-13 18:53:21,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:21,711 INFO L85 PathProgramCache]: Analyzing trace with hash 243526874, now seen corresponding path program 94 times [2025-04-13 18:53:21,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:21,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026811546] [2025-04-13 18:53:21,711 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:53:21,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:21,715 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:53:21,727 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:21,727 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:53:21,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:22,358 INFO L134 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:53:22,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:22,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026811546] [2025-04-13 18:53:22,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026811546] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:22,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:22,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:22,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865197031] [2025-04-13 18:53:22,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:22,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:22,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:22,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:22,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:22,359 INFO L87 Difference]: Start difference. First operand 10519 states and 40444 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:23,472 INFO L93 Difference]: Finished difference Result 19788 states and 73028 transitions. [2025-04-13 18:53:23,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:23,472 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:23,472 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:23,531 INFO L225 Difference]: With dead ends: 19788 [2025-04-13 18:53:23,531 INFO L226 Difference]: Without dead ends: 19718 [2025-04-13 18:53:23,537 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:23,538 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 302 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:23,538 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 579 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:23,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19718 states. [2025-04-13 18:53:23,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19718 to 10531. [2025-04-13 18:53:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10531 states, 10530 states have (on average 3.8442545109211776) internal successors, (40480), 10530 states have internal predecessors, (40480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10531 states to 10531 states and 40480 transitions. [2025-04-13 18:53:23,772 INFO L79 Accepts]: Start accepts. Automaton has 10531 states and 40480 transitions. Word has length 54 [2025-04-13 18:53:23,773 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:23,773 INFO L485 AbstractCegarLoop]: Abstraction has 10531 states and 40480 transitions. [2025-04-13 18:53:23,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:23,773 INFO L278 IsEmpty]: Start isEmpty. Operand 10531 states and 40480 transitions. [2025-04-13 18:53:23,789 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:23,789 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:23,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:23,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-04-13 18:53:23,790 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 2 more)] === [2025-04-13 18:53:23,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:23,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1453628122, now seen corresponding path program 95 times [2025-04-13 18:53:23,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:23,790 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512137532] [2025-04-13 18:53:23,790 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:53:23,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:23,793 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:23,803 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:23,803 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:53:23,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:24,448 INFO L134 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:53:24,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:24,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512137532] [2025-04-13 18:53:24,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512137532] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:24,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:24,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:24,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747173072] [2025-04-13 18:53:24,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:24,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:24,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:24,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:24,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:24,449 INFO L87 Difference]: Start difference. First operand 10531 states and 40480 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:25,325 INFO L93 Difference]: Finished difference Result 18947 states and 70172 transitions. [2025-04-13 18:53:25,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:25,326 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:25,326 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:25,383 INFO L225 Difference]: With dead ends: 18947 [2025-04-13 18:53:25,384 INFO L226 Difference]: Without dead ends: 18869 [2025-04-13 18:53:25,390 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:25,390 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 349 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:25,390 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 529 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:53:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18869 states. [2025-04-13 18:53:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18869 to 10523. [2025-04-13 18:53:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10523 states, 10522 states have (on average 3.844896407527086) internal successors, (40456), 10522 states have internal predecessors, (40456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10523 states to 10523 states and 40456 transitions. [2025-04-13 18:53:25,621 INFO L79 Accepts]: Start accepts. Automaton has 10523 states and 40456 transitions. Word has length 54 [2025-04-13 18:53:25,621 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:25,621 INFO L485 AbstractCegarLoop]: Abstraction has 10523 states and 40456 transitions. [2025-04-13 18:53:25,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:25,621 INFO L278 IsEmpty]: Start isEmpty. Operand 10523 states and 40456 transitions. [2025-04-13 18:53:25,637 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:25,637 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:25,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:25,638 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-04-13 18:53:25,638 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 2 more)] === [2025-04-13 18:53:25,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:25,638 INFO L85 PathProgramCache]: Analyzing trace with hash -726135046, now seen corresponding path program 96 times [2025-04-13 18:53:25,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:25,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336177289] [2025-04-13 18:53:25,638 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:53:25,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:25,641 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:25,650 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:25,650 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:53:25,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:26,268 INFO L134 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:53:26,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:26,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336177289] [2025-04-13 18:53:26,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336177289] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:26,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:26,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:26,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368098405] [2025-04-13 18:53:26,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:26,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:26,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:26,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:26,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:26,269 INFO L87 Difference]: Start difference. First operand 10523 states and 40456 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:27,268 INFO L93 Difference]: Finished difference Result 19774 states and 72979 transitions. [2025-04-13 18:53:27,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:27,268 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:27,268 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:27,327 INFO L225 Difference]: With dead ends: 19774 [2025-04-13 18:53:27,327 INFO L226 Difference]: Without dead ends: 19702 [2025-04-13 18:53:27,334 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:27,334 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 335 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:27,335 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 516 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:27,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19702 states. [2025-04-13 18:53:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19702 to 10515. [2025-04-13 18:53:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10515 states, 10514 states have (on average 3.8455392809587217) internal successors, (40432), 10514 states have internal predecessors, (40432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:27,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10515 states to 10515 states and 40432 transitions. [2025-04-13 18:53:27,569 INFO L79 Accepts]: Start accepts. Automaton has 10515 states and 40432 transitions. Word has length 54 [2025-04-13 18:53:27,569 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:27,569 INFO L485 AbstractCegarLoop]: Abstraction has 10515 states and 40432 transitions. [2025-04-13 18:53:27,569 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:27,570 INFO L278 IsEmpty]: Start isEmpty. Operand 10515 states and 40432 transitions. [2025-04-13 18:53:27,585 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:27,586 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:27,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:27,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-04-13 18:53:27,586 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 2 more)] === [2025-04-13 18:53:27,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:27,586 INFO L85 PathProgramCache]: Analyzing trace with hash 344761128, now seen corresponding path program 97 times [2025-04-13 18:53:27,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:27,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753291752] [2025-04-13 18:53:27,586 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:53:27,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:27,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:27,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:27,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:53:27,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:28,180 INFO L134 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:53:28,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:28,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753291752] [2025-04-13 18:53:28,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753291752] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:28,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:28,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:28,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653011710] [2025-04-13 18:53:28,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:28,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:28,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:28,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:28,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:28,181 INFO L87 Difference]: Start difference. First operand 10515 states and 40432 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:29,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:29,108 INFO L93 Difference]: Finished difference Result 18839 states and 69881 transitions. [2025-04-13 18:53:29,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:29,108 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:29,108 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:29,168 INFO L225 Difference]: With dead ends: 18839 [2025-04-13 18:53:29,169 INFO L226 Difference]: Without dead ends: 18775 [2025-04-13 18:53:29,175 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:29,175 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 280 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:29,175 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 573 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:29,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18775 states. [2025-04-13 18:53:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18775 to 10523. [2025-04-13 18:53:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10523 states, 10522 states have (on average 3.844516251663182) internal successors, (40452), 10522 states have internal predecessors, (40452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10523 states to 10523 states and 40452 transitions. [2025-04-13 18:53:29,454 INFO L79 Accepts]: Start accepts. Automaton has 10523 states and 40452 transitions. Word has length 54 [2025-04-13 18:53:29,454 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:29,454 INFO L485 AbstractCegarLoop]: Abstraction has 10523 states and 40452 transitions. [2025-04-13 18:53:29,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:29,454 INFO L278 IsEmpty]: Start isEmpty. Operand 10523 states and 40452 transitions. [2025-04-13 18:53:29,471 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:29,472 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:29,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:29,472 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-04-13 18:53:29,472 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 2 more)] === [2025-04-13 18:53:29,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:29,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1619488580, now seen corresponding path program 98 times [2025-04-13 18:53:29,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:29,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736330422] [2025-04-13 18:53:29,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:53:29,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:29,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:29,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:29,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:53:29,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:30,077 INFO L134 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:53:30,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:30,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736330422] [2025-04-13 18:53:30,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736330422] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:30,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:30,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:30,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575222843] [2025-04-13 18:53:30,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:30,078 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:30,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:30,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:30,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:30,078 INFO L87 Difference]: Start difference. First operand 10523 states and 40452 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:30,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:30,968 INFO L93 Difference]: Finished difference Result 19694 states and 72766 transitions. [2025-04-13 18:53:30,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:30,968 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:30,968 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:31,030 INFO L225 Difference]: With dead ends: 19694 [2025-04-13 18:53:31,030 INFO L226 Difference]: Without dead ends: 19624 [2025-04-13 18:53:31,036 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:31,037 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 314 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:31,037 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 519 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:53:31,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19624 states. [2025-04-13 18:53:31,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19624 to 10534. [2025-04-13 18:53:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10534 states, 10533 states have (on average 3.843064653944745) internal successors, (40479), 10533 states have internal predecessors, (40479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10534 states to 10534 states and 40479 transitions. [2025-04-13 18:53:31,264 INFO L79 Accepts]: Start accepts. Automaton has 10534 states and 40479 transitions. Word has length 54 [2025-04-13 18:53:31,265 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:31,265 INFO L485 AbstractCegarLoop]: Abstraction has 10534 states and 40479 transitions. [2025-04-13 18:53:31,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:31,265 INFO L278 IsEmpty]: Start isEmpty. Operand 10534 states and 40479 transitions. [2025-04-13 18:53:31,281 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:31,281 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:31,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:31,281 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-04-13 18:53:31,281 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 2 more)] === [2025-04-13 18:53:31,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2065219834, now seen corresponding path program 99 times [2025-04-13 18:53:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:31,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250294955] [2025-04-13 18:53:31,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:53:31,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:31,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:31,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:31,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:53:31,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:31,932 INFO L134 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:53:31,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:31,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250294955] [2025-04-13 18:53:31,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250294955] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:31,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:31,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:31,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734490523] [2025-04-13 18:53:31,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:31,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:31,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:31,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:31,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:31,933 INFO L87 Difference]: Start difference. First operand 10534 states and 40479 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:32,863 INFO L93 Difference]: Finished difference Result 18806 states and 69799 transitions. [2025-04-13 18:53:32,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:32,864 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:32,864 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:32,924 INFO L225 Difference]: With dead ends: 18806 [2025-04-13 18:53:32,924 INFO L226 Difference]: Without dead ends: 18730 [2025-04-13 18:53:32,930 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:32,930 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 265 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:32,931 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 544 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:53:32,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18730 states. [2025-04-13 18:53:33,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18730 to 10526. [2025-04-13 18:53:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10526 states, 10525 states have (on average 3.8437054631828977) internal successors, (40455), 10525 states have internal predecessors, (40455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10526 states to 10526 states and 40455 transitions. [2025-04-13 18:53:33,170 INFO L79 Accepts]: Start accepts. Automaton has 10526 states and 40455 transitions. Word has length 54 [2025-04-13 18:53:33,170 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:33,171 INFO L485 AbstractCegarLoop]: Abstraction has 10526 states and 40455 transitions. [2025-04-13 18:53:33,171 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:33,171 INFO L278 IsEmpty]: Start isEmpty. Operand 10526 states and 40455 transitions. [2025-04-13 18:53:33,187 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:33,187 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:33,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:33,187 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-04-13 18:53:33,187 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 2 more)] === [2025-04-13 18:53:33,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:33,187 INFO L85 PathProgramCache]: Analyzing trace with hash 265497754, now seen corresponding path program 100 times [2025-04-13 18:53:33,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:33,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004142191] [2025-04-13 18:53:33,188 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:53:33,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:33,191 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:53:33,203 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:33,203 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:53:33,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:33,837 INFO L134 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:53:33,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:33,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004142191] [2025-04-13 18:53:33,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004142191] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:33,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:33,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:33,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675164600] [2025-04-13 18:53:33,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:33,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:33,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:33,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:33,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:33,838 INFO L87 Difference]: Start difference. First operand 10526 states and 40455 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:34,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:34,862 INFO L93 Difference]: Finished difference Result 19639 states and 72620 transitions. [2025-04-13 18:53:34,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:34,862 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:34,862 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:34,922 INFO L225 Difference]: With dead ends: 19639 [2025-04-13 18:53:34,923 INFO L226 Difference]: Without dead ends: 19557 [2025-04-13 18:53:34,929 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:34,929 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 281 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:34,930 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 529 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:34,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19557 states. [2025-04-13 18:53:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19557 to 10515. [2025-04-13 18:53:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10515 states, 10514 states have (on average 3.844778390717139) internal successors, (40424), 10514 states have internal predecessors, (40424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10515 states to 10515 states and 40424 transitions. [2025-04-13 18:53:35,165 INFO L79 Accepts]: Start accepts. Automaton has 10515 states and 40424 transitions. Word has length 54 [2025-04-13 18:53:35,165 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:35,165 INFO L485 AbstractCegarLoop]: Abstraction has 10515 states and 40424 transitions. [2025-04-13 18:53:35,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:35,165 INFO L278 IsEmpty]: Start isEmpty. Operand 10515 states and 40424 transitions. [2025-04-13 18:53:35,181 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:35,181 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:35,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:35,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-04-13 18:53:35,182 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 2 more)] === [2025-04-13 18:53:35,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:35,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1146373384, now seen corresponding path program 101 times [2025-04-13 18:53:35,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:35,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314396989] [2025-04-13 18:53:35,182 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:53:35,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:35,185 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:35,195 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:35,195 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:53:35,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:35,801 INFO L134 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:53:35,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:35,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314396989] [2025-04-13 18:53:35,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314396989] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:35,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:35,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:35,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735118114] [2025-04-13 18:53:35,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:35,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:35,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:35,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:35,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:35,802 INFO L87 Difference]: Start difference. First operand 10515 states and 40424 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:36,730 INFO L93 Difference]: Finished difference Result 18867 states and 69957 transitions. [2025-04-13 18:53:36,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:36,730 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:36,730 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:36,797 INFO L225 Difference]: With dead ends: 18867 [2025-04-13 18:53:36,797 INFO L226 Difference]: Without dead ends: 18797 [2025-04-13 18:53:36,804 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:36,804 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 315 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:36,804 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 531 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:36,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18797 states. [2025-04-13 18:53:36,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18797 to 10525. [2025-04-13 18:53:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10525 states, 10524 states have (on average 3.8435005701254275) internal successors, (40449), 10524 states have internal predecessors, (40449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10525 states to 10525 states and 40449 transitions. [2025-04-13 18:53:37,030 INFO L79 Accepts]: Start accepts. Automaton has 10525 states and 40449 transitions. Word has length 54 [2025-04-13 18:53:37,030 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:37,030 INFO L485 AbstractCegarLoop]: Abstraction has 10525 states and 40449 transitions. [2025-04-13 18:53:37,030 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:37,030 INFO L278 IsEmpty]: Start isEmpty. Operand 10525 states and 40449 transitions. [2025-04-13 18:53:37,046 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:37,046 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:37,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:37,046 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-04-13 18:53:37,046 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 2 more)] === [2025-04-13 18:53:37,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:37,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1873866460, now seen corresponding path program 102 times [2025-04-13 18:53:37,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:37,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278602201] [2025-04-13 18:53:37,047 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:53:37,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:37,050 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:37,059 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:37,059 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:53:37,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:37,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:53:37,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:37,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278602201] [2025-04-13 18:53:37,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278602201] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:37,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:37,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:37,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831589659] [2025-04-13 18:53:37,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:37,663 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:37,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:37,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:37,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:37,664 INFO L87 Difference]: Start difference. First operand 10525 states and 40449 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:38,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:38,608 INFO L93 Difference]: Finished difference Result 19710 states and 72803 transitions. [2025-04-13 18:53:38,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:38,608 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:38,608 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:38,671 INFO L225 Difference]: With dead ends: 19710 [2025-04-13 18:53:38,671 INFO L226 Difference]: Without dead ends: 19646 [2025-04-13 18:53:38,677 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:38,678 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 320 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:38,678 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 549 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:38,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19646 states. [2025-04-13 18:53:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19646 to 10533. [2025-04-13 18:53:38,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10533 states, 10532 states have (on average 3.8424800607671856) internal successors, (40469), 10532 states have internal predecessors, (40469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:38,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10533 states to 10533 states and 40469 transitions. [2025-04-13 18:53:38,968 INFO L79 Accepts]: Start accepts. Automaton has 10533 states and 40469 transitions. Word has length 54 [2025-04-13 18:53:38,968 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:38,968 INFO L485 AbstractCegarLoop]: Abstraction has 10533 states and 40469 transitions. [2025-04-13 18:53:38,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:38,968 INFO L278 IsEmpty]: Start isEmpty. Operand 10533 states and 40469 transitions. [2025-04-13 18:53:38,984 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:38,984 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:38,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:38,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-04-13 18:53:38,985 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 2 more)] === [2025-04-13 18:53:38,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:38,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2066949350, now seen corresponding path program 103 times [2025-04-13 18:53:38,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:38,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568229672] [2025-04-13 18:53:38,985 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:53:38,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:38,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:38,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:38,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:53:38,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:39,606 INFO L134 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:53:39,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:39,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568229672] [2025-04-13 18:53:39,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568229672] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:39,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:39,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:39,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388943906] [2025-04-13 18:53:39,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:39,607 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:39,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:39,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:39,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:39,607 INFO L87 Difference]: Start difference. First operand 10533 states and 40469 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:40,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:40,496 INFO L93 Difference]: Finished difference Result 18805 states and 69789 transitions. [2025-04-13 18:53:40,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:40,496 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:40,496 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:40,554 INFO L225 Difference]: With dead ends: 18805 [2025-04-13 18:53:40,554 INFO L226 Difference]: Without dead ends: 18723 [2025-04-13 18:53:40,560 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:40,561 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 265 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:40,561 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 570 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:53:40,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18723 states. [2025-04-13 18:53:40,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18723 to 10519. [2025-04-13 18:53:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10519 states, 10518 states have (on average 3.8440768206883438) internal successors, (40432), 10518 states have internal predecessors, (40432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10519 states to 10519 states and 40432 transitions. [2025-04-13 18:53:40,781 INFO L79 Accepts]: Start accepts. Automaton has 10519 states and 40432 transitions. Word has length 54 [2025-04-13 18:53:40,781 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:40,781 INFO L485 AbstractCegarLoop]: Abstraction has 10519 states and 40432 transitions. [2025-04-13 18:53:40,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:40,781 INFO L278 IsEmpty]: Start isEmpty. Operand 10519 states and 40432 transitions. [2025-04-13 18:53:40,797 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:40,797 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:40,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:40,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-04-13 18:53:40,798 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 2 more)] === [2025-04-13 18:53:40,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:40,798 INFO L85 PathProgramCache]: Analyzing trace with hash 428295866, now seen corresponding path program 104 times [2025-04-13 18:53:40,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:40,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519246127] [2025-04-13 18:53:40,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:53:40,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:40,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:40,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:40,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:53:40,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:41,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:53:41,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:41,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519246127] [2025-04-13 18:53:41,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519246127] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:41,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:41,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:41,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354230011] [2025-04-13 18:53:41,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:41,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:41,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:41,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:41,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:41,435 INFO L87 Difference]: Start difference. First operand 10519 states and 40432 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:42,408 INFO L93 Difference]: Finished difference Result 19632 states and 72597 transitions. [2025-04-13 18:53:42,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:42,409 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:42,409 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:42,469 INFO L225 Difference]: With dead ends: 19632 [2025-04-13 18:53:42,469 INFO L226 Difference]: Without dead ends: 19549 [2025-04-13 18:53:42,477 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:42,477 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 271 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:42,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 593 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:42,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19549 states. [2025-04-13 18:53:42,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19549 to 10507. [2025-04-13 18:53:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10507 states, 10506 states have (on average 3.8454216638111554) internal successors, (40400), 10506 states have internal predecessors, (40400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10507 states to 10507 states and 40400 transitions. [2025-04-13 18:53:42,723 INFO L79 Accepts]: Start accepts. Automaton has 10507 states and 40400 transitions. Word has length 54 [2025-04-13 18:53:42,724 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:42,724 INFO L485 AbstractCegarLoop]: Abstraction has 10507 states and 40400 transitions. [2025-04-13 18:53:42,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:42,724 INFO L278 IsEmpty]: Start isEmpty. Operand 10507 states and 40400 transitions. [2025-04-13 18:53:42,740 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:42,740 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:42,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] [2025-04-13 18:53:42,740 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2025-04-13 18:53:42,740 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 2 more)] === [2025-04-13 18:53:42,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:42,740 INFO L85 PathProgramCache]: Analyzing trace with hash -436914780, now seen corresponding path program 105 times [2025-04-13 18:53:42,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:42,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002530291] [2025-04-13 18:53:42,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:53:42,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:42,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:42,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:42,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:53:42,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:43,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:53:43,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:43,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002530291] [2025-04-13 18:53:43,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002530291] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:43,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:43,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:43,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405320259] [2025-04-13 18:53:43,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:43,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:43,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:43,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:43,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:43,391 INFO L87 Difference]: Start difference. First operand 10507 states and 40400 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:44,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:44,400 INFO L93 Difference]: Finished difference Result 18751 states and 69630 transitions. [2025-04-13 18:53:44,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:44,401 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:44,401 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:44,464 INFO L225 Difference]: With dead ends: 18751 [2025-04-13 18:53:44,465 INFO L226 Difference]: Without dead ends: 18615 [2025-04-13 18:53:44,472 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:44,473 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 269 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:44,473 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 583 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:44,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18615 states. [2025-04-13 18:53:44,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18615 to 10537. [2025-04-13 18:53:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10537 states, 10536 states have (on average 3.8415907365223996) internal successors, (40475), 10536 states have internal predecessors, (40475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10537 states to 10537 states and 40475 transitions. [2025-04-13 18:53:44,734 INFO L79 Accepts]: Start accepts. Automaton has 10537 states and 40475 transitions. Word has length 54 [2025-04-13 18:53:44,734 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:44,734 INFO L485 AbstractCegarLoop]: Abstraction has 10537 states and 40475 transitions. [2025-04-13 18:53:44,734 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:44,734 INFO L278 IsEmpty]: Start isEmpty. Operand 10537 states and 40475 transitions. [2025-04-13 18:53:44,751 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:44,751 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:44,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] [2025-04-13 18:53:44,751 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-04-13 18:53:44,751 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 2 more)] === [2025-04-13 18:53:44,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:44,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2130225976, now seen corresponding path program 106 times [2025-04-13 18:53:44,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:44,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244395680] [2025-04-13 18:53:44,751 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:53:44,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:44,754 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:53:44,766 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:44,766 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:53:44,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:45,345 INFO L134 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:53:45,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:45,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244395680] [2025-04-13 18:53:45,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244395680] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:45,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:45,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:45,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855423106] [2025-04-13 18:53:45,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:45,346 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:45,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:45,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:45,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:45,346 INFO L87 Difference]: Start difference. First operand 10537 states and 40475 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:46,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:46,332 INFO L93 Difference]: Finished difference Result 19612 states and 72526 transitions. [2025-04-13 18:53:46,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:46,332 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:46,332 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:46,396 INFO L225 Difference]: With dead ends: 19612 [2025-04-13 18:53:46,396 INFO L226 Difference]: Without dead ends: 19500 [2025-04-13 18:53:46,403 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:46,404 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 300 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:46,404 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 506 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:53:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19500 states. [2025-04-13 18:53:46,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19500 to 10561. [2025-04-13 18:53:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10561 states, 10560 states have (on average 3.8385416666666665) internal successors, (40535), 10560 states have internal predecessors, (40535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10561 states to 10561 states and 40535 transitions. [2025-04-13 18:53:46,657 INFO L79 Accepts]: Start accepts. Automaton has 10561 states and 40535 transitions. Word has length 54 [2025-04-13 18:53:46,657 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:46,658 INFO L485 AbstractCegarLoop]: Abstraction has 10561 states and 40535 transitions. [2025-04-13 18:53:46,658 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:46,658 INFO L278 IsEmpty]: Start isEmpty. Operand 10561 states and 40535 transitions. [2025-04-13 18:53:46,674 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:46,674 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:46,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:46,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-04-13 18:53:46,674 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 2 more)] === [2025-04-13 18:53:46,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:46,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1974334010, now seen corresponding path program 107 times [2025-04-13 18:53:46,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:46,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029804229] [2025-04-13 18:53:46,675 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:53:46,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:46,678 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:46,689 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:46,689 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:53:46,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:53:47,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:47,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029804229] [2025-04-13 18:53:47,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029804229] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:47,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:47,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:47,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993633206] [2025-04-13 18:53:47,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:47,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:47,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:47,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:47,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:47,321 INFO L87 Difference]: Start difference. First operand 10561 states and 40535 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:48,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:48,308 INFO L93 Difference]: Finished difference Result 18717 states and 69495 transitions. [2025-04-13 18:53:48,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:48,309 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:48,309 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:48,446 INFO L225 Difference]: With dead ends: 18717 [2025-04-13 18:53:48,446 INFO L226 Difference]: Without dead ends: 18647 [2025-04-13 18:53:48,450 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:48,450 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 261 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:48,450 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 573 Invalid, 1618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:48,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18647 states. [2025-04-13 18:53:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18647 to 10571. [2025-04-13 18:53:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10571 states, 10570 states have (on average 3.837275307473983) internal successors, (40560), 10570 states have internal predecessors, (40560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10571 states to 10571 states and 40560 transitions. [2025-04-13 18:53:48,659 INFO L79 Accepts]: Start accepts. Automaton has 10571 states and 40560 transitions. Word has length 54 [2025-04-13 18:53:48,659 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:48,659 INFO L485 AbstractCegarLoop]: Abstraction has 10571 states and 40560 transitions. [2025-04-13 18:53:48,659 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:48,660 INFO L278 IsEmpty]: Start isEmpty. Operand 10571 states and 40560 transitions. [2025-04-13 18:53:48,676 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:48,676 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:48,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:48,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-04-13 18:53:48,676 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 2 more)] === [2025-04-13 18:53:48,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:48,677 INFO L85 PathProgramCache]: Analyzing trace with hash 256707418, now seen corresponding path program 108 times [2025-04-13 18:53:48,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:48,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046977013] [2025-04-13 18:53:48,677 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:53:48,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:48,680 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:48,689 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:48,689 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:53:48,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:49,272 INFO L134 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:53:49,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:49,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046977013] [2025-04-13 18:53:49,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046977013] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:49,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:49,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:49,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407014237] [2025-04-13 18:53:49,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:49,273 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:49,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:49,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:49,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:49,273 INFO L87 Difference]: Start difference. First operand 10571 states and 40560 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:50,179 INFO L93 Difference]: Finished difference Result 19589 states and 72430 transitions. [2025-04-13 18:53:50,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:50,180 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:50,180 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:50,247 INFO L225 Difference]: With dead ends: 19589 [2025-04-13 18:53:50,247 INFO L226 Difference]: Without dead ends: 19525 [2025-04-13 18:53:50,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:50,254 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 288 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:50,254 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 507 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:53:50,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19525 states. [2025-04-13 18:53:50,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19525 to 10579. [2025-04-13 18:53:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10579 states, 10578 states have (on average 3.836263944034789) internal successors, (40580), 10578 states have internal predecessors, (40580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10579 states to 10579 states and 40580 transitions. [2025-04-13 18:53:50,505 INFO L79 Accepts]: Start accepts. Automaton has 10579 states and 40580 transitions. Word has length 54 [2025-04-13 18:53:50,505 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:50,505 INFO L485 AbstractCegarLoop]: Abstraction has 10579 states and 40580 transitions. [2025-04-13 18:53:50,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:50,505 INFO L278 IsEmpty]: Start isEmpty. Operand 10579 states and 40580 transitions. [2025-04-13 18:53:50,523 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:50,523 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:50,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:50,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2025-04-13 18:53:50,523 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 2 more)] === [2025-04-13 18:53:50,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:50,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1053758044, now seen corresponding path program 109 times [2025-04-13 18:53:50,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:50,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840802194] [2025-04-13 18:53:50,524 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:53:50,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:50,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:50,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:50,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:53:50,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:53:51,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:51,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840802194] [2025-04-13 18:53:51,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840802194] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:51,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:51,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:51,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989646183] [2025-04-13 18:53:51,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:51,174 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:51,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:51,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:51,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:51,175 INFO L87 Difference]: Start difference. First operand 10579 states and 40580 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:52,056 INFO L93 Difference]: Finished difference Result 18655 states and 69327 transitions. [2025-04-13 18:53:52,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:52,056 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:52,056 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:52,115 INFO L225 Difference]: With dead ends: 18655 [2025-04-13 18:53:52,116 INFO L226 Difference]: Without dead ends: 18535 [2025-04-13 18:53:52,122 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:52,123 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 260 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:52,123 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 532 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:53:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18535 states. [2025-04-13 18:53:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18535 to 10527. [2025-04-13 18:53:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10527 states, 10526 states have (on average 3.8415352460573815) internal successors, (40436), 10526 states have internal predecessors, (40436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10527 states to 10527 states and 40436 transitions. [2025-04-13 18:53:52,362 INFO L79 Accepts]: Start accepts. Automaton has 10527 states and 40436 transitions. Word has length 54 [2025-04-13 18:53:52,362 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:52,362 INFO L485 AbstractCegarLoop]: Abstraction has 10527 states and 40436 transitions. [2025-04-13 18:53:52,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:52,362 INFO L278 IsEmpty]: Start isEmpty. Operand 10527 states and 40436 transitions. [2025-04-13 18:53:52,378 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:52,378 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:52,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:52,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-04-13 18:53:52,378 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 2 more)] === [2025-04-13 18:53:52,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:52,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1188863176, now seen corresponding path program 110 times [2025-04-13 18:53:52,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:52,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101504447] [2025-04-13 18:53:52,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:53:52,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:52,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:52,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:52,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:53:52,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:53,009 INFO L134 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:53:53,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:53,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101504447] [2025-04-13 18:53:53,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101504447] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:53,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:53,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:53,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111487915] [2025-04-13 18:53:53,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:53,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:53,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:53,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:53,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:53,010 INFO L87 Difference]: Start difference. First operand 10527 states and 40436 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:53,930 INFO L93 Difference]: Finished difference Result 19473 states and 72117 transitions. [2025-04-13 18:53:53,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:53,930 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:53,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:53,990 INFO L225 Difference]: With dead ends: 19473 [2025-04-13 18:53:53,990 INFO L226 Difference]: Without dead ends: 19358 [2025-04-13 18:53:53,997 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:53,997 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 262 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:53,997 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 510 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:53:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19358 states. [2025-04-13 18:53:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19358 to 10483. [2025-04-13 18:53:54,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10483 states, 10482 states have (on average 3.8458309482923108) internal successors, (40312), 10482 states have internal predecessors, (40312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10483 states to 10483 states and 40312 transitions. [2025-04-13 18:53:54,234 INFO L79 Accepts]: Start accepts. Automaton has 10483 states and 40312 transitions. Word has length 54 [2025-04-13 18:53:54,235 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:54,235 INFO L485 AbstractCegarLoop]: Abstraction has 10483 states and 40312 transitions. [2025-04-13 18:53:54,235 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:54,235 INFO L278 IsEmpty]: Start isEmpty. Operand 10483 states and 40312 transitions. [2025-04-13 18:53:54,251 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:54,251 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:54,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:54,251 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2025-04-13 18:53:54,251 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 2 more)] === [2025-04-13 18:53:54,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:54,252 INFO L85 PathProgramCache]: Analyzing trace with hash 736801096, now seen corresponding path program 111 times [2025-04-13 18:53:54,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:54,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565729491] [2025-04-13 18:53:54,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:53:54,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:54,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:54,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:54,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:53:54,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:54,942 INFO L134 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:53:54,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:54,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565729491] [2025-04-13 18:53:54,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565729491] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:54,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:54,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:54,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392408854] [2025-04-13 18:53:54,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:54,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:54,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:54,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:54,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:54,943 INFO L87 Difference]: Start difference. First operand 10483 states and 40312 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:55,893 INFO L93 Difference]: Finished difference Result 18899 states and 70028 transitions. [2025-04-13 18:53:55,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:55,893 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:55,893 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:55,950 INFO L225 Difference]: With dead ends: 18899 [2025-04-13 18:53:55,950 INFO L226 Difference]: Without dead ends: 18835 [2025-04-13 18:53:55,956 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:55,956 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 334 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:55,956 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 571 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18835 states. [2025-04-13 18:53:56,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18835 to 10527. [2025-04-13 18:53:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10527 states, 10526 states have (on average 3.8441953258597756) internal successors, (40464), 10526 states have internal predecessors, (40464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10527 states to 10527 states and 40464 transitions. [2025-04-13 18:53:56,205 INFO L79 Accepts]: Start accepts. Automaton has 10527 states and 40464 transitions. Word has length 54 [2025-04-13 18:53:56,205 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:56,206 INFO L485 AbstractCegarLoop]: Abstraction has 10527 states and 40464 transitions. [2025-04-13 18:53:56,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:56,206 INFO L278 IsEmpty]: Start isEmpty. Operand 10527 states and 40464 transitions. [2025-04-13 18:53:56,222 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:56,222 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:56,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] [2025-04-13 18:53:56,222 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2025-04-13 18:53:56,222 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 2 more)] === [2025-04-13 18:53:56,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:56,223 INFO L85 PathProgramCache]: Analyzing trace with hash -256707940, now seen corresponding path program 112 times [2025-04-13 18:53:56,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:56,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677969041] [2025-04-13 18:53:56,223 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:53:56,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:56,226 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:53:56,238 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:56,238 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:53:56,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:56,837 INFO L134 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:53:56,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:56,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677969041] [2025-04-13 18:53:56,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677969041] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:56,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:56,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:56,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584420172] [2025-04-13 18:53:56,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:56,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:56,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:56,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:56,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:56,838 INFO L87 Difference]: Start difference. First operand 10527 states and 40464 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:58,013 INFO L93 Difference]: Finished difference Result 19843 states and 73205 transitions. [2025-04-13 18:53:58,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:58,013 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:58,013 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:58,079 INFO L225 Difference]: With dead ends: 19843 [2025-04-13 18:53:58,080 INFO L226 Difference]: Without dead ends: 19773 [2025-04-13 18:53:58,086 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:58,086 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 340 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:58,086 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 575 Invalid, 1533 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:53:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19773 states. [2025-04-13 18:53:58,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19773 to 10571. [2025-04-13 18:53:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10571 states, 10570 states have (on average 3.842573320719016) internal successors, (40616), 10570 states have internal predecessors, (40616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10571 states to 10571 states and 40616 transitions. [2025-04-13 18:53:58,345 INFO L79 Accepts]: Start accepts. Automaton has 10571 states and 40616 transitions. Word has length 54 [2025-04-13 18:53:58,345 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:58,345 INFO L485 AbstractCegarLoop]: Abstraction has 10571 states and 40616 transitions. [2025-04-13 18:53:58,345 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:58,345 INFO L278 IsEmpty]: Start isEmpty. Operand 10571 states and 40616 transitions. [2025-04-13 18:53:58,362 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:53:58,362 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:58,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:58,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2025-04-13 18:53:58,362 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 2 more)] === [2025-04-13 18:53:58,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:58,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1706463016, now seen corresponding path program 113 times [2025-04-13 18:53:58,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:58,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122464172] [2025-04-13 18:53:58,363 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:53:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:58,365 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:53:58,376 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:53:58,376 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:53:58,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:58,988 INFO L134 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:53:58,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:58,988 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122464172] [2025-04-13 18:53:58,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122464172] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:58,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:58,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:53:58,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677392649] [2025-04-13 18:53:58,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:58,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:53:58,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:58,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:53:58,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:53:58,989 INFO L87 Difference]: Start difference. First operand 10571 states and 40616 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:59,858 INFO L93 Difference]: Finished difference Result 18879 states and 70011 transitions. [2025-04-13 18:53:59,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:53:59,859 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:53:59,859 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:59,924 INFO L225 Difference]: With dead ends: 18879 [2025-04-13 18:53:59,924 INFO L226 Difference]: Without dead ends: 18801 [2025-04-13 18:53:59,931 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:53:59,931 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 339 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:59,931 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 544 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:53:59,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18801 states. [2025-04-13 18:54:00,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18801 to 10563. [2025-04-13 18:54:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10563 states, 10562 states have (on average 3.8428327968187843) internal successors, (40588), 10562 states have internal predecessors, (40588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10563 states to 10563 states and 40588 transitions. [2025-04-13 18:54:00,233 INFO L79 Accepts]: Start accepts. Automaton has 10563 states and 40588 transitions. Word has length 54 [2025-04-13 18:54:00,233 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:00,233 INFO L485 AbstractCegarLoop]: Abstraction has 10563 states and 40588 transitions. [2025-04-13 18:54:00,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:00,233 INFO L278 IsEmpty]: Start isEmpty. Operand 10563 states and 40588 transitions. [2025-04-13 18:54:00,249 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:00,249 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:00,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:00,250 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2025-04-13 18:54:00,250 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 2 more)] === [2025-04-13 18:54:00,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:00,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1226369860, now seen corresponding path program 114 times [2025-04-13 18:54:00,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:00,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434474002] [2025-04-13 18:54:00,250 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:54:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:00,253 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:00,263 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:00,263 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:54:00,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:00,854 INFO L134 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:54:00,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:00,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434474002] [2025-04-13 18:54:00,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434474002] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:00,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:00,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:00,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313115985] [2025-04-13 18:54:00,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:00,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:00,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:00,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:00,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:00,854 INFO L87 Difference]: Start difference. First operand 10563 states and 40588 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:01,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:01,799 INFO L93 Difference]: Finished difference Result 19765 states and 72991 transitions. [2025-04-13 18:54:01,799 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:01,799 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:01,799 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:01,861 INFO L225 Difference]: With dead ends: 19765 [2025-04-13 18:54:01,861 INFO L226 Difference]: Without dead ends: 19693 [2025-04-13 18:54:01,867 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:01,867 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 294 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:01,867 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 611 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:54:01,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19693 states. [2025-04-13 18:54:02,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19693 to 10555. [2025-04-13 18:54:02,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10555 states, 10554 states have (on average 3.8430926662876637) internal successors, (40560), 10554 states have internal predecessors, (40560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:02,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10555 states to 10555 states and 40560 transitions. [2025-04-13 18:54:02,120 INFO L79 Accepts]: Start accepts. Automaton has 10555 states and 40560 transitions. Word has length 54 [2025-04-13 18:54:02,120 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:02,120 INFO L485 AbstractCegarLoop]: Abstraction has 10555 states and 40560 transitions. [2025-04-13 18:54:02,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:02,120 INFO L278 IsEmpty]: Start isEmpty. Operand 10555 states and 40560 transitions. [2025-04-13 18:54:02,137 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:02,137 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:02,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:02,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2025-04-13 18:54:02,137 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 2 more)] === [2025-04-13 18:54:02,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:02,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1941973690, now seen corresponding path program 115 times [2025-04-13 18:54:02,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:02,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400282046] [2025-04-13 18:54:02,137 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:54:02,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:02,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:02,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:02,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:54:02,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:02,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:54:02,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:02,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400282046] [2025-04-13 18:54:02,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400282046] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:02,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:02,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:02,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284397461] [2025-04-13 18:54:02,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:02,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:02,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:02,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:02,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:02,843 INFO L87 Difference]: Start difference. First operand 10555 states and 40560 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:03,913 INFO L93 Difference]: Finished difference Result 18905 states and 70082 transitions. [2025-04-13 18:54:03,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:03,913 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:03,913 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:03,970 INFO L225 Difference]: With dead ends: 18905 [2025-04-13 18:54:03,970 INFO L226 Difference]: Without dead ends: 18769 [2025-04-13 18:54:03,976 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:03,976 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 315 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:03,976 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 568 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:54:03,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18769 states. [2025-04-13 18:54:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18769 to 10531. [2025-04-13 18:54:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10531 states, 10530 states have (on average 3.84349477682811) internal successors, (40472), 10530 states have internal predecessors, (40472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10531 states to 10531 states and 40472 transitions. [2025-04-13 18:54:04,200 INFO L79 Accepts]: Start accepts. Automaton has 10531 states and 40472 transitions. Word has length 54 [2025-04-13 18:54:04,200 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:04,200 INFO L485 AbstractCegarLoop]: Abstraction has 10531 states and 40472 transitions. [2025-04-13 18:54:04,200 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:04,200 INFO L278 IsEmpty]: Start isEmpty. Operand 10531 states and 40472 transitions. [2025-04-13 18:54:04,216 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:04,216 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:04,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] [2025-04-13 18:54:04,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2025-04-13 18:54:04,216 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 2 more)] === [2025-04-13 18:54:04,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:04,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1348981466, now seen corresponding path program 116 times [2025-04-13 18:54:04,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:04,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574204583] [2025-04-13 18:54:04,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:54:04,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:04,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:04,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:04,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:54:04,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:04,873 INFO L134 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:54:04,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:04,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574204583] [2025-04-13 18:54:04,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574204583] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:04,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:04,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:04,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574056847] [2025-04-13 18:54:04,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:04,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:04,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:04,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:04,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:04,874 INFO L87 Difference]: Start difference. First operand 10531 states and 40472 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:05,829 INFO L93 Difference]: Finished difference Result 19805 states and 73087 transitions. [2025-04-13 18:54:05,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:05,829 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:05,829 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:05,888 INFO L225 Difference]: With dead ends: 19805 [2025-04-13 18:54:05,889 INFO L226 Difference]: Without dead ends: 19645 [2025-04-13 18:54:05,895 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:05,895 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 336 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:05,895 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 519 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:05,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19645 states. [2025-04-13 18:54:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19645 to 10507. [2025-04-13 18:54:06,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10507 states, 10506 states have (on average 3.843898724538359) internal successors, (40384), 10506 states have internal predecessors, (40384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10507 states to 10507 states and 40384 transitions. [2025-04-13 18:54:06,132 INFO L79 Accepts]: Start accepts. Automaton has 10507 states and 40384 transitions. Word has length 54 [2025-04-13 18:54:06,132 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:06,132 INFO L485 AbstractCegarLoop]: Abstraction has 10507 states and 40384 transitions. [2025-04-13 18:54:06,132 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:06,132 INFO L278 IsEmpty]: Start isEmpty. Operand 10507 states and 40384 transitions. [2025-04-13 18:54:06,148 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:06,148 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:06,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:06,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2025-04-13 18:54:06,149 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 2 more)] === [2025-04-13 18:54:06,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:06,149 INFO L85 PathProgramCache]: Analyzing trace with hash -593127066, now seen corresponding path program 117 times [2025-04-13 18:54:06,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:06,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828331026] [2025-04-13 18:54:06,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:54:06,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:06,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:06,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:06,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:54:06,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:54:06,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:06,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828331026] [2025-04-13 18:54:06,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828331026] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:06,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:06,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:06,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882268345] [2025-04-13 18:54:06,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:06,790 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:06,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:06,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:06,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:06,790 INFO L87 Difference]: Start difference. First operand 10507 states and 40384 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:07,761 INFO L93 Difference]: Finished difference Result 18899 states and 70014 transitions. [2025-04-13 18:54:07,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:07,761 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:07,761 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:07,821 INFO L225 Difference]: With dead ends: 18899 [2025-04-13 18:54:07,821 INFO L226 Difference]: Without dead ends: 18835 [2025-04-13 18:54:07,828 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:07,828 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 324 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:07,828 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 596 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:54:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18835 states. [2025-04-13 18:54:08,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18835 to 10519. [2025-04-13 18:54:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10519 states, 10518 states have (on average 3.8429359193763073) internal successors, (40420), 10518 states have internal predecessors, (40420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10519 states to 10519 states and 40420 transitions. [2025-04-13 18:54:08,056 INFO L79 Accepts]: Start accepts. Automaton has 10519 states and 40420 transitions. Word has length 54 [2025-04-13 18:54:08,056 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:08,056 INFO L485 AbstractCegarLoop]: Abstraction has 10519 states and 40420 transitions. [2025-04-13 18:54:08,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:08,056 INFO L278 IsEmpty]: Start isEmpty. Operand 10519 states and 40420 transitions. [2025-04-13 18:54:08,072 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:08,072 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:08,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] [2025-04-13 18:54:08,073 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2025-04-13 18:54:08,073 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 2 more)] === [2025-04-13 18:54:08,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:08,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1586636102, now seen corresponding path program 118 times [2025-04-13 18:54:08,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:08,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70032338] [2025-04-13 18:54:08,073 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:54:08,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:08,076 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:54:08,087 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:08,087 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:54:08,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:08,696 INFO L134 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:54:08,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:08,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70032338] [2025-04-13 18:54:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70032338] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:08,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:08,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:08,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389884713] [2025-04-13 18:54:08,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:08,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:08,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:08,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:08,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:08,697 INFO L87 Difference]: Start difference. First operand 10519 states and 40420 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:09,756 INFO L93 Difference]: Finished difference Result 19821 states and 73102 transitions. [2025-04-13 18:54:09,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:09,756 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:09,756 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:09,821 INFO L225 Difference]: With dead ends: 19821 [2025-04-13 18:54:09,821 INFO L226 Difference]: Without dead ends: 19751 [2025-04-13 18:54:09,827 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:09,827 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 335 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:09,827 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 537 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19751 states. [2025-04-13 18:54:09,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19751 to 10531. [2025-04-13 18:54:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10531 states, 10530 states have (on average 3.8419753086419752) internal successors, (40456), 10530 states have internal predecessors, (40456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10531 states to 10531 states and 40456 transitions. [2025-04-13 18:54:10,054 INFO L79 Accepts]: Start accepts. Automaton has 10531 states and 40456 transitions. Word has length 54 [2025-04-13 18:54:10,055 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:10,055 INFO L485 AbstractCegarLoop]: Abstraction has 10531 states and 40456 transitions. [2025-04-13 18:54:10,055 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:10,055 INFO L278 IsEmpty]: Start isEmpty. Operand 10531 states and 40456 transitions. [2025-04-13 18:54:10,071 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:10,071 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:10,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:54:10,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2025-04-13 18:54:10,071 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 2 more)] === [2025-04-13 18:54:10,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:10,071 INFO L85 PathProgramCache]: Analyzing trace with hash 376534854, now seen corresponding path program 119 times [2025-04-13 18:54:10,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:10,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815488313] [2025-04-13 18:54:10,071 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:54:10,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:10,074 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:10,084 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:10,084 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:54:10,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:10,666 INFO L134 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:54:10,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:10,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815488313] [2025-04-13 18:54:10,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815488313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:10,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:10,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:10,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465039868] [2025-04-13 18:54:10,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:10,667 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:10,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:10,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:10,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:10,668 INFO L87 Difference]: Start difference. First operand 10531 states and 40456 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:11,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:11,533 INFO L93 Difference]: Finished difference Result 18917 states and 70059 transitions. [2025-04-13 18:54:11,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:11,533 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:11,533 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:11,594 INFO L225 Difference]: With dead ends: 18917 [2025-04-13 18:54:11,594 INFO L226 Difference]: Without dead ends: 18839 [2025-04-13 18:54:11,600 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:11,600 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 343 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:11,600 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 575 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:11,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18839 states. [2025-04-13 18:54:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18839 to 10523. [2025-04-13 18:54:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10523 states, 10522 states have (on average 3.842615472343661) internal successors, (40432), 10522 states have internal predecessors, (40432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:11,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10523 states to 10523 states and 40432 transitions. [2025-04-13 18:54:11,914 INFO L79 Accepts]: Start accepts. Automaton has 10523 states and 40432 transitions. Word has length 54 [2025-04-13 18:54:11,915 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:11,915 INFO L485 AbstractCegarLoop]: Abstraction has 10523 states and 40432 transitions. [2025-04-13 18:54:11,915 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:11,915 INFO L278 IsEmpty]: Start isEmpty. Operand 10523 states and 40432 transitions. [2025-04-13 18:54:11,930 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:11,931 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:11,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:11,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2025-04-13 18:54:11,931 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 2 more)] === [2025-04-13 18:54:11,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:11,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1738669274, now seen corresponding path program 120 times [2025-04-13 18:54:11,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:11,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893115940] [2025-04-13 18:54:11,932 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:54:11,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:11,934 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:11,943 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:11,943 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:54:11,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:12,538 INFO L134 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:54:12,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:12,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893115940] [2025-04-13 18:54:12,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893115940] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:12,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:12,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:12,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229499284] [2025-04-13 18:54:12,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:12,539 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:12,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:12,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:12,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:12,539 INFO L87 Difference]: Start difference. First operand 10523 states and 40432 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:13,442 INFO L93 Difference]: Finished difference Result 19807 states and 73053 transitions. [2025-04-13 18:54:13,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:13,443 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:13,443 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:13,506 INFO L225 Difference]: With dead ends: 19807 [2025-04-13 18:54:13,506 INFO L226 Difference]: Without dead ends: 19735 [2025-04-13 18:54:13,512 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:13,513 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 316 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:13,513 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 571 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19735 states. [2025-04-13 18:54:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19735 to 10515. [2025-04-13 18:54:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10515 states, 10514 states have (on average 3.843256610233974) internal successors, (40408), 10514 states have internal predecessors, (40408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10515 states to 10515 states and 40408 transitions. [2025-04-13 18:54:13,771 INFO L79 Accepts]: Start accepts. Automaton has 10515 states and 40408 transitions. Word has length 54 [2025-04-13 18:54:13,772 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:13,772 INFO L485 AbstractCegarLoop]: Abstraction has 10515 states and 40408 transitions. [2025-04-13 18:54:13,772 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:13,772 INFO L278 IsEmpty]: Start isEmpty. Operand 10515 states and 40408 transitions. [2025-04-13 18:54:13,788 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:13,788 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:13,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:54:13,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2025-04-13 18:54:13,788 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 2 more)] === [2025-04-13 18:54:13,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2120043192, now seen corresponding path program 121 times [2025-04-13 18:54:13,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:13,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889782419] [2025-04-13 18:54:13,789 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:54:13,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:13,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:13,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:13,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:54:13,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:14,418 INFO L134 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:54:14,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:14,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889782419] [2025-04-13 18:54:14,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889782419] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:14,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:14,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:14,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886771015] [2025-04-13 18:54:14,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:14,418 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:14,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:14,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:14,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:14,419 INFO L87 Difference]: Start difference. First operand 10515 states and 40408 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:15,352 INFO L93 Difference]: Finished difference Result 18907 states and 70034 transitions. [2025-04-13 18:54:15,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:15,352 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:15,352 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:15,409 INFO L225 Difference]: With dead ends: 18907 [2025-04-13 18:54:15,409 INFO L226 Difference]: Without dead ends: 18843 [2025-04-13 18:54:15,415 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:15,415 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 327 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 1541 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:15,415 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 556 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1541 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:15,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18843 states. [2025-04-13 18:54:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18843 to 10523. [2025-04-13 18:54:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10523 states, 10522 states have (on average 3.8422353164797567) internal successors, (40428), 10522 states have internal predecessors, (40428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:15,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10523 states to 10523 states and 40428 transitions. [2025-04-13 18:54:15,641 INFO L79 Accepts]: Start accepts. Automaton has 10523 states and 40428 transitions. Word has length 54 [2025-04-13 18:54:15,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:15,641 INFO L485 AbstractCegarLoop]: Abstraction has 10523 states and 40428 transitions. [2025-04-13 18:54:15,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:15,641 INFO L278 IsEmpty]: Start isEmpty. Operand 10523 states and 40428 transitions. [2025-04-13 18:54:15,657 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:15,657 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:15,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:15,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2025-04-13 18:54:15,657 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 2 more)] === [2025-04-13 18:54:15,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:15,658 INFO L85 PathProgramCache]: Analyzing trace with hash 845315740, now seen corresponding path program 122 times [2025-04-13 18:54:15,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:15,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835470722] [2025-04-13 18:54:15,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:54:15,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:15,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:15,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:15,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:54:15,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:16,297 INFO L134 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:54:16,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:16,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835470722] [2025-04-13 18:54:16,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835470722] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:16,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:16,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:16,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329571867] [2025-04-13 18:54:16,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:16,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:16,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:16,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:16,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:16,298 INFO L87 Difference]: Start difference. First operand 10523 states and 40428 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:17,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:17,210 INFO L93 Difference]: Finished difference Result 19825 states and 73106 transitions. [2025-04-13 18:54:17,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:17,210 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:17,210 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:17,272 INFO L225 Difference]: With dead ends: 19825 [2025-04-13 18:54:17,272 INFO L226 Difference]: Without dead ends: 19755 [2025-04-13 18:54:17,278 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:17,279 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 321 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:17,279 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 557 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19755 states. [2025-04-13 18:54:17,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19755 to 10534. [2025-04-13 18:54:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10534 states, 10533 states have (on average 3.8407861008259756) internal successors, (40455), 10533 states have internal predecessors, (40455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10534 states to 10534 states and 40455 transitions. [2025-04-13 18:54:17,522 INFO L79 Accepts]: Start accepts. Automaton has 10534 states and 40455 transitions. Word has length 54 [2025-04-13 18:54:17,522 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:17,522 INFO L485 AbstractCegarLoop]: Abstraction has 10534 states and 40455 transitions. [2025-04-13 18:54:17,522 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:17,522 INFO L278 IsEmpty]: Start isEmpty. Operand 10534 states and 40455 transitions. [2025-04-13 18:54:17,538 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:17,539 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:17,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:54:17,539 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2025-04-13 18:54:17,539 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 2 more)] === [2025-04-13 18:54:17,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:17,539 INFO L85 PathProgramCache]: Analyzing trace with hash -235056858, now seen corresponding path program 123 times [2025-04-13 18:54:17,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:17,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30467446] [2025-04-13 18:54:17,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:54:17,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:17,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:17,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:17,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:54:17,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:18,151 INFO L134 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:54:18,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:18,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30467446] [2025-04-13 18:54:18,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30467446] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:18,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:18,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:18,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999354624] [2025-04-13 18:54:18,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:18,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:18,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:18,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:18,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:18,152 INFO L87 Difference]: Start difference. First operand 10534 states and 40455 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:19,184 INFO L93 Difference]: Finished difference Result 18874 states and 69952 transitions. [2025-04-13 18:54:19,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:19,184 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:19,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:19,243 INFO L225 Difference]: With dead ends: 18874 [2025-04-13 18:54:19,244 INFO L226 Difference]: Without dead ends: 18798 [2025-04-13 18:54:19,251 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:19,251 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 274 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:19,251 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 622 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:54:19,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18798 states. [2025-04-13 18:54:19,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18798 to 10526. [2025-04-13 18:54:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10526 states, 10525 states have (on average 3.8414251781472686) internal successors, (40431), 10525 states have internal predecessors, (40431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10526 states to 10526 states and 40431 transitions. [2025-04-13 18:54:19,477 INFO L79 Accepts]: Start accepts. Automaton has 10526 states and 40431 transitions. Word has length 54 [2025-04-13 18:54:19,478 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:19,478 INFO L485 AbstractCegarLoop]: Abstraction has 10526 states and 40431 transitions. [2025-04-13 18:54:19,478 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:19,478 INFO L278 IsEmpty]: Start isEmpty. Operand 10526 states and 40431 transitions. [2025-04-13 18:54:19,493 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:19,494 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:19,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:19,494 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2025-04-13 18:54:19,494 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 2 more)] === [2025-04-13 18:54:19,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:19,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1564665222, now seen corresponding path program 124 times [2025-04-13 18:54:19,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:19,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649879200] [2025-04-13 18:54:19,494 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:54:19,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:19,497 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:54:19,509 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:19,509 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:54:19,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:20,105 INFO L134 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:54:20,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:20,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649879200] [2025-04-13 18:54:20,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649879200] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:20,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:20,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:20,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776896022] [2025-04-13 18:54:20,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:20,105 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:20,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:20,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:20,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:20,105 INFO L87 Difference]: Start difference. First operand 10526 states and 40431 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:21,093 INFO L93 Difference]: Finished difference Result 19770 states and 72960 transitions. [2025-04-13 18:54:21,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:21,093 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:21,093 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:21,158 INFO L225 Difference]: With dead ends: 19770 [2025-04-13 18:54:21,158 INFO L226 Difference]: Without dead ends: 19688 [2025-04-13 18:54:21,164 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:21,165 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 306 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:21,165 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 552 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:54:21,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19688 states. [2025-04-13 18:54:21,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19688 to 10515. [2025-04-13 18:54:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10515 states, 10514 states have (on average 3.842495719992391) internal successors, (40400), 10514 states have internal predecessors, (40400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10515 states to 10515 states and 40400 transitions. [2025-04-13 18:54:21,460 INFO L79 Accepts]: Start accepts. Automaton has 10515 states and 40400 transitions. Word has length 54 [2025-04-13 18:54:21,460 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:21,460 INFO L485 AbstractCegarLoop]: Abstraction has 10515 states and 40400 transitions. [2025-04-13 18:54:21,461 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:21,461 INFO L278 IsEmpty]: Start isEmpty. Operand 10515 states and 40400 transitions. [2025-04-13 18:54:21,476 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:21,477 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:21,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:21,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2025-04-13 18:54:21,477 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 2 more)] === [2025-04-13 18:54:21,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:21,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1318430936, now seen corresponding path program 125 times [2025-04-13 18:54:21,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:21,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435508371] [2025-04-13 18:54:21,478 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:54:21,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:21,480 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:21,491 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:21,491 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:54:21,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:54:22,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:22,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435508371] [2025-04-13 18:54:22,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435508371] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:22,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:22,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:22,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735623586] [2025-04-13 18:54:22,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:22,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:22,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:22,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:22,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:22,071 INFO L87 Difference]: Start difference. First operand 10515 states and 40400 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:22,935 INFO L93 Difference]: Finished difference Result 18815 states and 69777 transitions. [2025-04-13 18:54:22,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:22,935 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:22,935 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:23,003 INFO L225 Difference]: With dead ends: 18815 [2025-04-13 18:54:23,003 INFO L226 Difference]: Without dead ends: 18745 [2025-04-13 18:54:23,010 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:23,010 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 311 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:23,010 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 554 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:23,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18745 states. [2025-04-13 18:54:23,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18745 to 10525. [2025-04-13 18:54:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10525 states, 10524 states have (on average 3.8412200684150513) internal successors, (40425), 10524 states have internal predecessors, (40425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10525 states to 10525 states and 40425 transitions. [2025-04-13 18:54:23,241 INFO L79 Accepts]: Start accepts. Automaton has 10525 states and 40425 transitions. Word has length 54 [2025-04-13 18:54:23,241 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:23,241 INFO L485 AbstractCegarLoop]: Abstraction has 10525 states and 40425 transitions. [2025-04-13 18:54:23,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:23,241 INFO L278 IsEmpty]: Start isEmpty. Operand 10525 states and 40425 transitions. [2025-04-13 18:54:23,257 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:23,257 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:23,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:23,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2025-04-13 18:54:23,257 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 2 more)] === [2025-04-13 18:54:23,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:23,258 INFO L85 PathProgramCache]: Analyzing trace with hash 43703484, now seen corresponding path program 126 times [2025-04-13 18:54:23,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:23,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728485128] [2025-04-13 18:54:23,258 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:54:23,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:23,261 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:23,269 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:23,269 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:54:23,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:23,888 INFO L134 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:54:23,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:23,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728485128] [2025-04-13 18:54:23,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728485128] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:23,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:23,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:23,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9374740] [2025-04-13 18:54:23,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:23,888 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:23,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:23,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:23,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:23,889 INFO L87 Difference]: Start difference. First operand 10525 states and 40425 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:24,820 INFO L93 Difference]: Finished difference Result 19723 states and 72820 transitions. [2025-04-13 18:54:24,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:24,820 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:24,820 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:24,879 INFO L225 Difference]: With dead ends: 19723 [2025-04-13 18:54:24,879 INFO L226 Difference]: Without dead ends: 19659 [2025-04-13 18:54:24,885 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:24,886 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 299 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:24,886 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 583 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:54:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19659 states. [2025-04-13 18:54:25,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19659 to 10533. [2025-04-13 18:54:25,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10533 states, 10532 states have (on average 3.8402012913026966) internal successors, (40445), 10532 states have internal predecessors, (40445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10533 states to 10533 states and 40445 transitions. [2025-04-13 18:54:25,118 INFO L79 Accepts]: Start accepts. Automaton has 10533 states and 40445 transitions. Word has length 54 [2025-04-13 18:54:25,118 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:25,118 INFO L485 AbstractCegarLoop]: Abstraction has 10533 states and 40445 transitions. [2025-04-13 18:54:25,118 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:25,119 INFO L278 IsEmpty]: Start isEmpty. Operand 10533 states and 40445 transitions. [2025-04-13 18:54:25,134 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:25,134 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:25,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:25,134 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2025-04-13 18:54:25,134 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 2 more)] === [2025-04-13 18:54:25,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:25,134 INFO L85 PathProgramCache]: Analyzing trace with hash -397854970, now seen corresponding path program 127 times [2025-04-13 18:54:25,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:25,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722885622] [2025-04-13 18:54:25,135 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:54:25,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:25,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:25,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:25,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:54:25,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:25,786 INFO L134 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:54:25,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:25,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722885622] [2025-04-13 18:54:25,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722885622] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:25,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:25,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:25,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641776567] [2025-04-13 18:54:25,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:25,786 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:25,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:25,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:25,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:25,787 INFO L87 Difference]: Start difference. First operand 10533 states and 40445 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:26,646 INFO L93 Difference]: Finished difference Result 18773 states and 69669 transitions. [2025-04-13 18:54:26,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:26,647 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:26,647 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:26,706 INFO L225 Difference]: With dead ends: 18773 [2025-04-13 18:54:26,706 INFO L226 Difference]: Without dead ends: 18691 [2025-04-13 18:54:26,713 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:26,713 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 294 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:26,713 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 571 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18691 states. [2025-04-13 18:54:26,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18691 to 10519. [2025-04-13 18:54:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10519 states, 10518 states have (on average 3.841795018064271) internal successors, (40408), 10518 states have internal predecessors, (40408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10519 states to 10519 states and 40408 transitions. [2025-04-13 18:54:26,948 INFO L79 Accepts]: Start accepts. Automaton has 10519 states and 40408 transitions. Word has length 54 [2025-04-13 18:54:26,948 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:26,948 INFO L485 AbstractCegarLoop]: Abstraction has 10519 states and 40408 transitions. [2025-04-13 18:54:26,948 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:26,949 INFO L278 IsEmpty]: Start isEmpty. Operand 10519 states and 40408 transitions. [2025-04-13 18:54:26,964 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:26,965 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:26,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:26,965 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2025-04-13 18:54:26,965 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 2 more)] === [2025-04-13 18:54:26,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:26,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1401867110, now seen corresponding path program 128 times [2025-04-13 18:54:26,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:26,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944021179] [2025-04-13 18:54:26,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:54:26,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:26,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:26,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:26,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:54:26,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:27,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:54:27,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:27,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944021179] [2025-04-13 18:54:27,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944021179] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:27,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:27,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:27,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459742093] [2025-04-13 18:54:27,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:27,589 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:27,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:27,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:27,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:27,589 INFO L87 Difference]: Start difference. First operand 10519 states and 40408 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:28,492 INFO L93 Difference]: Finished difference Result 19668 states and 72681 transitions. [2025-04-13 18:54:28,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:28,492 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:28,493 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:28,560 INFO L225 Difference]: With dead ends: 19668 [2025-04-13 18:54:28,560 INFO L226 Difference]: Without dead ends: 19585 [2025-04-13 18:54:28,567 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:28,567 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 315 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:28,568 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 501 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:28,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19585 states. [2025-04-13 18:54:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19585 to 10507. [2025-04-13 18:54:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10507 states, 10506 states have (on average 3.843137254901961) internal successors, (40376), 10506 states have internal predecessors, (40376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10507 states to 10507 states and 40376 transitions. [2025-04-13 18:54:28,811 INFO L79 Accepts]: Start accepts. Automaton has 10507 states and 40376 transitions. Word has length 54 [2025-04-13 18:54:28,811 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:28,811 INFO L485 AbstractCegarLoop]: Abstraction has 10507 states and 40376 transitions. [2025-04-13 18:54:28,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:28,811 INFO L278 IsEmpty]: Start isEmpty. Operand 10507 states and 40376 transitions. [2025-04-13 18:54:28,828 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:28,828 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:28,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:28,828 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2025-04-13 18:54:28,828 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 2 more)] === [2025-04-13 18:54:28,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2031733340, now seen corresponding path program 129 times [2025-04-13 18:54:28,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:28,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818948147] [2025-04-13 18:54:28,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:54:28,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:28,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:28,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:28,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:54:28,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:29,444 INFO L134 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:54:29,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:29,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818948147] [2025-04-13 18:54:29,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818948147] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:29,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:29,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:29,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695758694] [2025-04-13 18:54:29,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:29,444 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:29,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:29,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:29,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:29,445 INFO L87 Difference]: Start difference. First operand 10507 states and 40376 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:30,422 INFO L93 Difference]: Finished difference Result 18715 states and 69500 transitions. [2025-04-13 18:54:30,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:30,423 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:30,423 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:30,481 INFO L225 Difference]: With dead ends: 18715 [2025-04-13 18:54:30,481 INFO L226 Difference]: Without dead ends: 18603 [2025-04-13 18:54:30,487 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:30,487 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 297 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:30,487 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 556 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:54:30,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18603 states. [2025-04-13 18:54:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18603 to 10531. [2025-04-13 18:54:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10531 states, 10530 states have (on average 3.8400759734093066) internal successors, (40436), 10530 states have internal predecessors, (40436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10531 states to 10531 states and 40436 transitions. [2025-04-13 18:54:30,780 INFO L79 Accepts]: Start accepts. Automaton has 10531 states and 40436 transitions. Word has length 54 [2025-04-13 18:54:30,780 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:30,780 INFO L485 AbstractCegarLoop]: Abstraction has 10531 states and 40436 transitions. [2025-04-13 18:54:30,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:30,780 INFO L278 IsEmpty]: Start isEmpty. Operand 10531 states and 40436 transitions. [2025-04-13 18:54:30,796 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:30,796 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:30,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:30,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2025-04-13 18:54:30,796 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 2 more)] === [2025-04-13 18:54:30,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:30,797 INFO L85 PathProgramCache]: Analyzing trace with hash -569922760, now seen corresponding path program 130 times [2025-04-13 18:54:30,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:30,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14435869] [2025-04-13 18:54:30,797 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:54:30,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:30,800 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:54:30,812 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:30,812 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:54:30,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:31,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:54:31,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:31,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14435869] [2025-04-13 18:54:31,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14435869] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:31,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:31,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:31,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214261240] [2025-04-13 18:54:31,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:31,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:31,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:31,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:31,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:31,391 INFO L87 Difference]: Start difference. First operand 10531 states and 40436 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:32,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:32,339 INFO L93 Difference]: Finished difference Result 19645 states and 72602 transitions. [2025-04-13 18:54:32,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:32,340 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:32,340 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:32,405 INFO L225 Difference]: With dead ends: 19645 [2025-04-13 18:54:32,405 INFO L226 Difference]: Without dead ends: 19509 [2025-04-13 18:54:32,412 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:32,413 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 289 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:32,413 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 544 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19509 states. [2025-04-13 18:54:32,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19509 to 10564. [2025-04-13 18:54:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10564 states, 10563 states have (on average 3.835747420240462) internal successors, (40517), 10563 states have internal predecessors, (40517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10564 states to 10564 states and 40517 transitions. [2025-04-13 18:54:32,679 INFO L79 Accepts]: Start accepts. Automaton has 10564 states and 40517 transitions. Word has length 54 [2025-04-13 18:54:32,679 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:32,679 INFO L485 AbstractCegarLoop]: Abstraction has 10564 states and 40517 transitions. [2025-04-13 18:54:32,679 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:32,680 INFO L278 IsEmpty]: Start isEmpty. Operand 10564 states and 40517 transitions. [2025-04-13 18:54:32,695 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:32,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:32,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:32,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2025-04-13 18:54:32,696 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 2 more)] === [2025-04-13 18:54:32,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash 557765062, now seen corresponding path program 131 times [2025-04-13 18:54:32,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:32,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460162143] [2025-04-13 18:54:32,696 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:54:32,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:32,699 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:32,710 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:32,710 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:54:32,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:54:33,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:33,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460162143] [2025-04-13 18:54:33,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460162143] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:33,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:33,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:33,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272644836] [2025-04-13 18:54:33,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:33,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:33,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:33,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:33,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:33,363 INFO L87 Difference]: Start difference. First operand 10564 states and 40517 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:34,274 INFO L93 Difference]: Finished difference Result 18712 states and 69453 transitions. [2025-04-13 18:54:34,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:34,275 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:34,275 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:34,331 INFO L225 Difference]: With dead ends: 18712 [2025-04-13 18:54:34,332 INFO L226 Difference]: Without dead ends: 18648 [2025-04-13 18:54:34,337 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:34,338 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 303 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:34,338 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 557 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:34,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18648 states. [2025-04-13 18:54:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18648 to 10572. [2025-04-13 18:54:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10572 states, 10571 states have (on average 3.83473654337338) internal successors, (40537), 10571 states have internal predecessors, (40537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10572 states to 10572 states and 40537 transitions. [2025-04-13 18:54:34,574 INFO L79 Accepts]: Start accepts. Automaton has 10572 states and 40537 transitions. Word has length 54 [2025-04-13 18:54:34,574 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:34,574 INFO L485 AbstractCegarLoop]: Abstraction has 10572 states and 40537 transitions. [2025-04-13 18:54:34,574 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:34,574 INFO L278 IsEmpty]: Start isEmpty. Operand 10572 states and 40537 transitions. [2025-04-13 18:54:34,590 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:34,591 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:34,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:34,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2025-04-13 18:54:34,591 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 2 more)] === [2025-04-13 18:54:34,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:34,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2019575642, now seen corresponding path program 132 times [2025-04-13 18:54:34,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:34,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127365869] [2025-04-13 18:54:34,591 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:54:34,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:34,594 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:34,603 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:34,603 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:54:34,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:54:35,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:35,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127365869] [2025-04-13 18:54:35,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127365869] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:35,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:35,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:35,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001260940] [2025-04-13 18:54:35,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:35,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:35,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:35,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:35,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:35,261 INFO L87 Difference]: Start difference. First operand 10572 states and 40537 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:36,185 INFO L93 Difference]: Finished difference Result 19599 states and 72434 transitions. [2025-04-13 18:54:36,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:36,186 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:36,186 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:36,249 INFO L225 Difference]: With dead ends: 19599 [2025-04-13 18:54:36,249 INFO L226 Difference]: Without dead ends: 19529 [2025-04-13 18:54:36,255 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:36,255 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 297 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:36,256 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 511 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19529 states. [2025-04-13 18:54:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19529 to 10583. [2025-04-13 18:54:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10583 states, 10582 states have (on average 3.8333018333018334) internal successors, (40564), 10582 states have internal predecessors, (40564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10583 states to 10583 states and 40564 transitions. [2025-04-13 18:54:36,492 INFO L79 Accepts]: Start accepts. Automaton has 10583 states and 40564 transitions. Word has length 54 [2025-04-13 18:54:36,492 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:36,492 INFO L485 AbstractCegarLoop]: Abstraction has 10583 states and 40564 transitions. [2025-04-13 18:54:36,492 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:36,492 INFO L278 IsEmpty]: Start isEmpty. Operand 10583 states and 40564 transitions. [2025-04-13 18:54:36,508 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:36,508 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:36,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:36,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2025-04-13 18:54:36,509 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 2 more)] === [2025-04-13 18:54:36,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:36,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1852215900, now seen corresponding path program 133 times [2025-04-13 18:54:36,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:36,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598301663] [2025-04-13 18:54:36,509 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:54:36,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:36,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:36,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:36,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:54:36,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:37,101 INFO L134 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:54:37,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:37,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598301663] [2025-04-13 18:54:37,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598301663] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:37,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:37,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:37,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953465572] [2025-04-13 18:54:37,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:37,105 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:37,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:37,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:37,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:37,106 INFO L87 Difference]: Start difference. First operand 10583 states and 40564 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:38,034 INFO L93 Difference]: Finished difference Result 18659 states and 69311 transitions. [2025-04-13 18:54:38,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:38,034 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:38,034 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:38,090 INFO L225 Difference]: With dead ends: 18659 [2025-04-13 18:54:38,090 INFO L226 Difference]: Without dead ends: 18511 [2025-04-13 18:54:38,096 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:38,096 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 276 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:38,096 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 497 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:38,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18511 states. [2025-04-13 18:54:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18511 to 10503. [2025-04-13 18:54:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10503 states, 10502 states have (on average 3.8392687107217673) internal successors, (40320), 10502 states have internal predecessors, (40320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10503 states to 10503 states and 40320 transitions. [2025-04-13 18:54:38,330 INFO L79 Accepts]: Start accepts. Automaton has 10503 states and 40320 transitions. Word has length 54 [2025-04-13 18:54:38,330 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:38,330 INFO L485 AbstractCegarLoop]: Abstraction has 10503 states and 40320 transitions. [2025-04-13 18:54:38,330 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:38,330 INFO L278 IsEmpty]: Start isEmpty. Operand 10503 states and 40320 transitions. [2025-04-13 18:54:38,346 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:38,346 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:38,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:38,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2025-04-13 18:54:38,346 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 2 more)] === [2025-04-13 18:54:38,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:38,346 INFO L85 PathProgramCache]: Analyzing trace with hash -390405320, now seen corresponding path program 134 times [2025-04-13 18:54:38,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:38,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541733060] [2025-04-13 18:54:38,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:54:38,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:38,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:38,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:38,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:54:38,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:38,959 INFO L134 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:54:38,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:38,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541733060] [2025-04-13 18:54:38,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541733060] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:38,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:38,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:38,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463774390] [2025-04-13 18:54:38,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:38,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:38,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:38,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:38,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:38,960 INFO L87 Difference]: Start difference. First operand 10503 states and 40320 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:39,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:39,920 INFO L93 Difference]: Finished difference Result 19449 states and 72001 transitions. [2025-04-13 18:54:39,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:39,920 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:39,920 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:39,983 INFO L225 Difference]: With dead ends: 19449 [2025-04-13 18:54:39,984 INFO L226 Difference]: Without dead ends: 19286 [2025-04-13 18:54:39,990 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:54:39,990 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 257 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:39,990 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 567 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:40,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19286 states. [2025-04-13 18:54:40,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19286 to 10411. [2025-04-13 18:54:40,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10411 states, 10410 states have (on average 3.8470701248799233) internal successors, (40048), 10410 states have internal predecessors, (40048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10411 states to 10411 states and 40048 transitions. [2025-04-13 18:54:40,273 INFO L79 Accepts]: Start accepts. Automaton has 10411 states and 40048 transitions. Word has length 54 [2025-04-13 18:54:40,273 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:40,273 INFO L485 AbstractCegarLoop]: Abstraction has 10411 states and 40048 transitions. [2025-04-13 18:54:40,273 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:40,274 INFO L278 IsEmpty]: Start isEmpty. Operand 10411 states and 40048 transitions. [2025-04-13 18:54:40,289 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:40,289 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:40,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:40,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2025-04-13 18:54:40,289 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 2 more)] === [2025-04-13 18:54:40,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:40,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1248813946, now seen corresponding path program 135 times [2025-04-13 18:54:40,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:40,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225258116] [2025-04-13 18:54:40,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:54:40,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:40,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:40,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:40,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:54:40,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:54:40,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:40,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225258116] [2025-04-13 18:54:40,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225258116] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:40,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:40,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:40,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005639499] [2025-04-13 18:54:40,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:40,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:40,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:40,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:40,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:40,872 INFO L87 Difference]: Start difference. First operand 10411 states and 40048 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:41,896 INFO L93 Difference]: Finished difference Result 18945 states and 70257 transitions. [2025-04-13 18:54:41,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:54:41,896 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:41,896 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:41,955 INFO L225 Difference]: With dead ends: 18945 [2025-04-13 18:54:41,955 INFO L226 Difference]: Without dead ends: 18881 [2025-04-13 18:54:41,961 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:54:41,961 INFO L437 NwaCegarLoop]: 116 mSDtfsCounter, 302 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:41,961 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 553 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:54:41,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18881 states. [2025-04-13 18:54:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18881 to 10479. [2025-04-13 18:54:42,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10479 states, 10478 states have (on average 3.8457720939110516) internal successors, (40296), 10478 states have internal predecessors, (40296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10479 states to 10479 states and 40296 transitions. [2025-04-13 18:54:42,223 INFO L79 Accepts]: Start accepts. Automaton has 10479 states and 40296 transitions. Word has length 54 [2025-04-13 18:54:42,223 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:42,223 INFO L485 AbstractCegarLoop]: Abstraction has 10479 states and 40296 transitions. [2025-04-13 18:54:42,223 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:42,223 INFO L278 IsEmpty]: Start isEmpty. Operand 10479 states and 40296 transitions. [2025-04-13 18:54:42,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:42,239 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:42,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:42,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2025-04-13 18:54:42,239 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 2 more)] === [2025-04-13 18:54:42,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:42,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1047819750, now seen corresponding path program 136 times [2025-04-13 18:54:42,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:42,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363296529] [2025-04-13 18:54:42,240 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:54:42,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:42,242 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:54:42,256 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:42,256 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:54:42,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:42,912 INFO L134 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:54:42,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:42,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363296529] [2025-04-13 18:54:42,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363296529] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:42,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:42,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:42,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963778587] [2025-04-13 18:54:42,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:42,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:42,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:42,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:42,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:42,913 INFO L87 Difference]: Start difference. First operand 10479 states and 40296 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:44,050 INFO L93 Difference]: Finished difference Result 19912 states and 73509 transitions. [2025-04-13 18:54:44,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:54:44,050 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:44,050 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:44,109 INFO L225 Difference]: With dead ends: 19912 [2025-04-13 18:54:44,109 INFO L226 Difference]: Without dead ends: 19842 [2025-04-13 18:54:44,116 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=515, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:54:44,116 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 293 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:44,116 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 520 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:54:44,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19842 states. [2025-04-13 18:54:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19842 to 10547. [2025-04-13 18:54:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10547 states, 10546 states have (on average 3.844490802199886) internal successors, (40544), 10546 states have internal predecessors, (40544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10547 states to 10547 states and 40544 transitions. [2025-04-13 18:54:44,349 INFO L79 Accepts]: Start accepts. Automaton has 10547 states and 40544 transitions. Word has length 54 [2025-04-13 18:54:44,349 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:44,349 INFO L485 AbstractCegarLoop]: Abstraction has 10547 states and 40544 transitions. [2025-04-13 18:54:44,349 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:44,349 INFO L278 IsEmpty]: Start isEmpty. Operand 10547 states and 40544 transitions. [2025-04-13 18:54:44,365 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:44,365 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:44,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:44,365 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2025-04-13 18:54:44,365 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 2 more)] === [2025-04-13 18:54:44,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:44,365 INFO L85 PathProgramCache]: Analyzing trace with hash -279152026, now seen corresponding path program 137 times [2025-04-13 18:54:44,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:44,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947725345] [2025-04-13 18:54:44,365 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:54:44,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:44,368 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:44,379 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:44,379 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:54:44,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:45,062 INFO L134 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:54:45,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:45,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947725345] [2025-04-13 18:54:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947725345] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:45,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:45,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:45,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118715745] [2025-04-13 18:54:45,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:45,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:45,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:45,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:45,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:45,063 INFO L87 Difference]: Start difference. First operand 10547 states and 40544 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:46,083 INFO L93 Difference]: Finished difference Result 19019 states and 70514 transitions. [2025-04-13 18:54:46,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:54:46,083 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:46,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:46,149 INFO L225 Difference]: With dead ends: 19019 [2025-04-13 18:54:46,149 INFO L226 Difference]: Without dead ends: 18941 [2025-04-13 18:54:46,155 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:54:46,155 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 283 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:46,155 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 562 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1590 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:54:46,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18941 states. [2025-04-13 18:54:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18941 to 10539. [2025-04-13 18:54:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10539 states, 10538 states have (on average 3.8447523249193396) internal successors, (40516), 10538 states have internal predecessors, (40516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10539 states to 10539 states and 40516 transitions. [2025-04-13 18:54:46,381 INFO L79 Accepts]: Start accepts. Automaton has 10539 states and 40516 transitions. Word has length 54 [2025-04-13 18:54:46,381 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:46,381 INFO L485 AbstractCegarLoop]: Abstraction has 10539 states and 40516 transitions. [2025-04-13 18:54:46,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:46,381 INFO L278 IsEmpty]: Start isEmpty. Operand 10539 states and 40516 transitions. [2025-04-13 18:54:46,397 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:46,397 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:46,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:46,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2025-04-13 18:54:46,397 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 2 more)] === [2025-04-13 18:54:46,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:46,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2017481670, now seen corresponding path program 138 times [2025-04-13 18:54:46,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:46,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268601315] [2025-04-13 18:54:46,397 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:54:46,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:46,400 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:46,409 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:46,409 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:54:46,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:54:47,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:47,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268601315] [2025-04-13 18:54:47,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268601315] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:47,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:47,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:47,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173871361] [2025-04-13 18:54:47,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:47,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:47,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:47,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:47,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:47,058 INFO L87 Difference]: Start difference. First operand 10539 states and 40516 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:48,143 INFO L93 Difference]: Finished difference Result 19898 states and 73456 transitions. [2025-04-13 18:54:48,143 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:54:48,143 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:48,143 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:48,202 INFO L225 Difference]: With dead ends: 19898 [2025-04-13 18:54:48,202 INFO L226 Difference]: Without dead ends: 19826 [2025-04-13 18:54:48,208 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=480, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:54:48,209 INFO L437 NwaCegarLoop]: 115 mSDtfsCounter, 288 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:48,209 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 556 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1620 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:54:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19826 states. [2025-04-13 18:54:48,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19826 to 10531. [2025-04-13 18:54:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10531 states, 10530 states have (on average 3.845014245014245) internal successors, (40488), 10530 states have internal predecessors, (40488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10531 states to 10531 states and 40488 transitions. [2025-04-13 18:54:48,434 INFO L79 Accepts]: Start accepts. Automaton has 10531 states and 40488 transitions. Word has length 54 [2025-04-13 18:54:48,435 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:48,435 INFO L485 AbstractCegarLoop]: Abstraction has 10531 states and 40488 transitions. [2025-04-13 18:54:48,435 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:48,435 INFO L278 IsEmpty]: Start isEmpty. Operand 10531 states and 40488 transitions. [2025-04-13 18:54:48,450 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:48,450 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:48,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:48,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2025-04-13 18:54:48,450 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 2 more)] === [2025-04-13 18:54:48,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1326537380, now seen corresponding path program 139 times [2025-04-13 18:54:48,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:48,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382816615] [2025-04-13 18:54:48,451 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:54:48,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:48,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:48,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:48,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:54:48,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:49,116 INFO L134 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:54:49,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:49,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382816615] [2025-04-13 18:54:49,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382816615] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:49,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:49,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:49,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55410545] [2025-04-13 18:54:49,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:49,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:49,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:49,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:49,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:49,117 INFO L87 Difference]: Start difference. First operand 10531 states and 40488 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:50,102 INFO L93 Difference]: Finished difference Result 18997 states and 70425 transitions. [2025-04-13 18:54:50,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:54:50,102 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:50,102 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:50,160 INFO L225 Difference]: With dead ends: 18997 [2025-04-13 18:54:50,160 INFO L226 Difference]: Without dead ends: 18837 [2025-04-13 18:54:50,166 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:54:50,166 INFO L437 NwaCegarLoop]: 115 mSDtfsCounter, 292 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:50,166 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 520 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:54:50,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18837 states. [2025-04-13 18:54:50,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18837 to 10507. [2025-04-13 18:54:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10507 states, 10506 states have (on average 3.8454216638111554) internal successors, (40400), 10506 states have internal predecessors, (40400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:50,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10507 states to 10507 states and 40400 transitions. [2025-04-13 18:54:50,393 INFO L79 Accepts]: Start accepts. Automaton has 10507 states and 40400 transitions. Word has length 54 [2025-04-13 18:54:50,393 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:50,393 INFO L485 AbstractCegarLoop]: Abstraction has 10507 states and 40400 transitions. [2025-04-13 18:54:50,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:50,393 INFO L278 IsEmpty]: Start isEmpty. Operand 10507 states and 40400 transitions. [2025-04-13 18:54:50,409 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:50,409 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:50,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:50,409 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2025-04-13 18:54:50,409 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 2 more)] === [2025-04-13 18:54:50,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:50,410 INFO L85 PathProgramCache]: Analyzing trace with hash -401289160, now seen corresponding path program 140 times [2025-04-13 18:54:50,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:50,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701848717] [2025-04-13 18:54:50,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:54:50,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:50,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:50,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:50,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:54:50,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:54:51,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:51,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701848717] [2025-04-13 18:54:51,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701848717] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:51,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:51,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:51,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641687263] [2025-04-13 18:54:51,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:51,037 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:51,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:51,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:51,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:51,037 INFO L87 Difference]: Start difference. First operand 10507 states and 40400 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:52,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:52,154 INFO L93 Difference]: Finished difference Result 19824 states and 73205 transitions. [2025-04-13 18:54:52,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:54:52,154 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:52,155 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:52,220 INFO L225 Difference]: With dead ends: 19824 [2025-04-13 18:54:52,220 INFO L226 Difference]: Without dead ends: 19688 [2025-04-13 18:54:52,227 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:54:52,227 INFO L437 NwaCegarLoop]: 116 mSDtfsCounter, 302 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:52,227 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 523 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:54:52,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19688 states. [2025-04-13 18:54:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19688 to 10483. [2025-04-13 18:54:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10483 states, 10482 states have (on average 3.8458309482923108) internal successors, (40312), 10482 states have internal predecessors, (40312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10483 states to 10483 states and 40312 transitions. [2025-04-13 18:54:52,475 INFO L79 Accepts]: Start accepts. Automaton has 10483 states and 40312 transitions. Word has length 54 [2025-04-13 18:54:52,475 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:52,475 INFO L485 AbstractCegarLoop]: Abstraction has 10483 states and 40312 transitions. [2025-04-13 18:54:52,475 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:52,475 INFO L278 IsEmpty]: Start isEmpty. Operand 10483 states and 40312 transitions. [2025-04-13 18:54:52,492 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:52,492 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:52,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:54:52,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2025-04-13 18:54:52,492 INFO L403 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:54:52,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1664169820, now seen corresponding path program 141 times [2025-04-13 18:54:52,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:52,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384843176] [2025-04-13 18:54:52,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:54:52,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:52,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:52,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:52,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:54:52,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:53,096 INFO L134 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:54:53,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:53,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384843176] [2025-04-13 18:54:53,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384843176] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:53,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:53,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:53,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443070320] [2025-04-13 18:54:53,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:53,097 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:53,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:53,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:53,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:53,097 INFO L87 Difference]: Start difference. First operand 10483 states and 40312 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:53,983 INFO L93 Difference]: Finished difference Result 19061 states and 70543 transitions. [2025-04-13 18:54:53,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:54:53,984 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:53,984 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:54,041 INFO L225 Difference]: With dead ends: 19061 [2025-04-13 18:54:54,041 INFO L226 Difference]: Without dead ends: 18997 [2025-04-13 18:54:54,047 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:54:54,048 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 300 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:54,048 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 552 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18997 states. [2025-04-13 18:54:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18997 to 10495. [2025-04-13 18:54:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10495 states, 10494 states have (on average 3.8448637316561847) internal successors, (40348), 10494 states have internal predecessors, (40348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10495 states to 10495 states and 40348 transitions. [2025-04-13 18:54:54,336 INFO L79 Accepts]: Start accepts. Automaton has 10495 states and 40348 transitions. Word has length 54 [2025-04-13 18:54:54,336 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:54,336 INFO L485 AbstractCegarLoop]: Abstraction has 10495 states and 40348 transitions. [2025-04-13 18:54:54,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:54,337 INFO L278 IsEmpty]: Start isEmpty. Operand 10495 states and 40348 transitions. [2025-04-13 18:54:54,352 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:54,352 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:54,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] [2025-04-13 18:54:54,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2025-04-13 18:54:54,352 INFO L403 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:54:54,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1002647096, now seen corresponding path program 142 times [2025-04-13 18:54:54,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:54,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774498115] [2025-04-13 18:54:54,353 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:54:54,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:54,356 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:54:54,369 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:54,369 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:54:54,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:54,921 INFO L134 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:54:54,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:54,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774498115] [2025-04-13 18:54:54,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774498115] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:54,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:54,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:54,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417755956] [2025-04-13 18:54:54,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:54,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:54,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:54,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:54,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:54,922 INFO L87 Difference]: Start difference. First operand 10495 states and 40348 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:55,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:55,833 INFO L93 Difference]: Finished difference Result 19958 states and 73542 transitions. [2025-04-13 18:54:55,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:54:55,833 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:55,833 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:55,899 INFO L225 Difference]: With dead ends: 19958 [2025-04-13 18:54:55,900 INFO L226 Difference]: Without dead ends: 19888 [2025-04-13 18:54:55,906 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:54:55,906 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 317 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:55,906 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 548 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:55,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19888 states. [2025-04-13 18:54:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19888 to 10507. [2025-04-13 18:54:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10507 states, 10506 states have (on average 3.843898724538359) internal successors, (40384), 10506 states have internal predecessors, (40384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10507 states to 10507 states and 40384 transitions. [2025-04-13 18:54:56,145 INFO L79 Accepts]: Start accepts. Automaton has 10507 states and 40384 transitions. Word has length 54 [2025-04-13 18:54:56,145 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:56,145 INFO L485 AbstractCegarLoop]: Abstraction has 10507 states and 40384 transitions. [2025-04-13 18:54:56,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:56,145 INFO L278 IsEmpty]: Start isEmpty. Operand 10507 states and 40384 transitions. [2025-04-13 18:54:56,161 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:56,161 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:56,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:56,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2025-04-13 18:54:56,161 INFO L403 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:54:56,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:56,161 INFO L85 PathProgramCache]: Analyzing trace with hash -694507900, now seen corresponding path program 143 times [2025-04-13 18:54:56,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:56,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483223777] [2025-04-13 18:54:56,162 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:54:56,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:56,164 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:56,174 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:56,174 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:54:56,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:56,793 INFO L134 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:54:56,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:56,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483223777] [2025-04-13 18:54:56,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483223777] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:56,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:56,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:56,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612893743] [2025-04-13 18:54:56,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:56,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:56,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:56,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:56,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:56,794 INFO L87 Difference]: Start difference. First operand 10507 states and 40384 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:57,731 INFO L93 Difference]: Finished difference Result 19079 states and 70588 transitions. [2025-04-13 18:54:57,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:54:57,731 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:57,731 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:57,790 INFO L225 Difference]: With dead ends: 19079 [2025-04-13 18:54:57,790 INFO L226 Difference]: Without dead ends: 19001 [2025-04-13 18:54:57,796 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:54:57,797 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 310 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:57,797 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 563 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:57,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19001 states. [2025-04-13 18:54:57,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19001 to 10499. [2025-04-13 18:54:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10499 states, 10498 states have (on average 3.8445418174890453) internal successors, (40360), 10498 states have internal predecessors, (40360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10499 states to 10499 states and 40360 transitions. [2025-04-13 18:54:58,032 INFO L79 Accepts]: Start accepts. Automaton has 10499 states and 40360 transitions. Word has length 54 [2025-04-13 18:54:58,032 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:58,032 INFO L485 AbstractCegarLoop]: Abstraction has 10499 states and 40360 transitions. [2025-04-13 18:54:58,032 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:58,032 INFO L278 IsEmpty]: Start isEmpty. Operand 10499 states and 40360 transitions. [2025-04-13 18:54:58,048 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:58,048 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:58,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:58,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2025-04-13 18:54:58,048 INFO L403 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:54:58,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:58,049 INFO L85 PathProgramCache]: Analyzing trace with hash 32985176, now seen corresponding path program 144 times [2025-04-13 18:54:58,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:58,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685408840] [2025-04-13 18:54:58,049 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:54:58,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:58,051 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:58,060 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:58,060 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:54:58,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:58,689 INFO L134 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:54:58,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:58,689 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685408840] [2025-04-13 18:54:58,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685408840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:58,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:58,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:54:58,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234652344] [2025-04-13 18:54:58,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:58,690 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:54:58,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:58,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:54:58,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:54:58,690 INFO L87 Difference]: Start difference. First operand 10499 states and 40360 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:59,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:59,629 INFO L93 Difference]: Finished difference Result 19944 states and 73493 transitions. [2025-04-13 18:54:59,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:54:59,629 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:54:59,629 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:59,690 INFO L225 Difference]: With dead ends: 19944 [2025-04-13 18:54:59,690 INFO L226 Difference]: Without dead ends: 19872 [2025-04-13 18:54:59,697 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:54:59,697 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 313 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:59,697 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 530 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:54:59,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19872 states. [2025-04-13 18:54:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19872 to 10491. [2025-04-13 18:54:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10491 states, 10490 states have (on average 3.8451858913250714) internal successors, (40336), 10490 states have internal predecessors, (40336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10491 states to 10491 states and 40336 transitions. [2025-04-13 18:54:59,943 INFO L79 Accepts]: Start accepts. Automaton has 10491 states and 40336 transitions. Word has length 54 [2025-04-13 18:54:59,943 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:59,943 INFO L485 AbstractCegarLoop]: Abstraction has 10491 states and 40336 transitions. [2025-04-13 18:54:59,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:59,943 INFO L278 IsEmpty]: Start isEmpty. Operand 10491 states and 40336 transitions. [2025-04-13 18:54:59,960 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:54:59,960 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:59,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:59,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2025-04-13 18:54:59,960 INFO L403 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:54:59,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:59,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1103881350, now seen corresponding path program 145 times [2025-04-13 18:54:59,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:59,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31399904] [2025-04-13 18:54:59,960 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:54:59,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:59,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:54:59,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:54:59,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:54:59,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:00,540 INFO L134 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:55:00,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:00,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31399904] [2025-04-13 18:55:00,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31399904] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:00,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:00,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:00,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074531734] [2025-04-13 18:55:00,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:00,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:00,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:00,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:00,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:00,541 INFO L87 Difference]: Start difference. First operand 10491 states and 40336 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:01,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:01,533 INFO L93 Difference]: Finished difference Result 18971 states and 70297 transitions. [2025-04-13 18:55:01,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:55:01,533 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:01,533 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:01,593 INFO L225 Difference]: With dead ends: 18971 [2025-04-13 18:55:01,593 INFO L226 Difference]: Without dead ends: 18907 [2025-04-13 18:55:01,600 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:55:01,600 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 293 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:01,600 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 565 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:55:01,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18907 states. [2025-04-13 18:55:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18907 to 10499. [2025-04-13 18:55:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10499 states, 10498 states have (on average 3.844160792531911) internal successors, (40356), 10498 states have internal predecessors, (40356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10499 states to 10499 states and 40356 transitions. [2025-04-13 18:55:01,834 INFO L79 Accepts]: Start accepts. Automaton has 10499 states and 40356 transitions. Word has length 54 [2025-04-13 18:55:01,834 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:01,834 INFO L485 AbstractCegarLoop]: Abstraction has 10499 states and 40356 transitions. [2025-04-13 18:55:01,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:01,834 INFO L278 IsEmpty]: Start isEmpty. Operand 10499 states and 40356 transitions. [2025-04-13 18:55:01,850 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:01,850 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:01,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:01,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2025-04-13 18:55:01,850 INFO L403 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:01,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:01,850 INFO L85 PathProgramCache]: Analyzing trace with hash -860368358, now seen corresponding path program 146 times [2025-04-13 18:55:01,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:01,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684658845] [2025-04-13 18:55:01,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:55:01,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:01,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:01,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:01,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:55:01,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:02,448 INFO L134 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:55:02,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:02,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684658845] [2025-04-13 18:55:02,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684658845] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:02,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:02,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:02,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809064691] [2025-04-13 18:55:02,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:02,449 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:02,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:02,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:02,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:02,449 INFO L87 Difference]: Start difference. First operand 10499 states and 40356 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:03,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:03,295 INFO L93 Difference]: Finished difference Result 19864 states and 73280 transitions. [2025-04-13 18:55:03,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:55:03,296 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:03,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:03,363 INFO L225 Difference]: With dead ends: 19864 [2025-04-13 18:55:03,363 INFO L226 Difference]: Without dead ends: 19794 [2025-04-13 18:55:03,370 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:55:03,370 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 316 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:03,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 482 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:03,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19794 states. [2025-04-13 18:55:03,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19794 to 10510. [2025-04-13 18:55:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10510 states, 10509 states have (on average 3.842706251784185) internal successors, (40383), 10509 states have internal predecessors, (40383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10510 states to 10510 states and 40383 transitions. [2025-04-13 18:55:03,702 INFO L79 Accepts]: Start accepts. Automaton has 10510 states and 40383 transitions. Word has length 54 [2025-04-13 18:55:03,702 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:03,702 INFO L485 AbstractCegarLoop]: Abstraction has 10510 states and 40383 transitions. [2025-04-13 18:55:03,702 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:03,702 INFO L278 IsEmpty]: Start isEmpty. Operand 10510 states and 40383 transitions. [2025-04-13 18:55:03,718 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:03,718 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:03,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:03,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2025-04-13 18:55:03,718 INFO L403 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:03,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:03,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1306099612, now seen corresponding path program 147 times [2025-04-13 18:55:03,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:03,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577645416] [2025-04-13 18:55:03,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:55:03,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:03,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:03,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:03,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:55:03,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:04,295 INFO L134 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:55:04,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:04,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577645416] [2025-04-13 18:55:04,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577645416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:04,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:04,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:04,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235957624] [2025-04-13 18:55:04,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:04,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:04,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:04,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:04,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:04,296 INFO L87 Difference]: Start difference. First operand 10510 states and 40383 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:05,164 INFO L93 Difference]: Finished difference Result 18938 states and 70215 transitions. [2025-04-13 18:55:05,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:55:05,165 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:05,165 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:05,223 INFO L225 Difference]: With dead ends: 18938 [2025-04-13 18:55:05,223 INFO L226 Difference]: Without dead ends: 18862 [2025-04-13 18:55:05,229 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:55:05,229 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 277 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:05,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 529 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:05,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2025-04-13 18:55:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 10502. [2025-04-13 18:55:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10502 states, 10501 states have (on average 3.8433482525473766) internal successors, (40359), 10501 states have internal predecessors, (40359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10502 states to 10502 states and 40359 transitions. [2025-04-13 18:55:05,456 INFO L79 Accepts]: Start accepts. Automaton has 10502 states and 40359 transitions. Word has length 54 [2025-04-13 18:55:05,456 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:05,456 INFO L485 AbstractCegarLoop]: Abstraction has 10502 states and 40359 transitions. [2025-04-13 18:55:05,456 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:05,456 INFO L278 IsEmpty]: Start isEmpty. Operand 10502 states and 40359 transitions. [2025-04-13 18:55:05,472 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:05,472 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:05,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:05,472 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2025-04-13 18:55:05,472 INFO L403 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:05,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:05,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1024617976, now seen corresponding path program 148 times [2025-04-13 18:55:05,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:05,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707253736] [2025-04-13 18:55:05,473 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:55:05,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:05,475 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:55:05,489 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:05,489 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:55:05,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:06,091 INFO L134 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:55:06,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:06,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707253736] [2025-04-13 18:55:06,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707253736] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:06,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:06,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:06,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36383295] [2025-04-13 18:55:06,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:06,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:06,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:06,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:06,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:06,092 INFO L87 Difference]: Start difference. First operand 10502 states and 40359 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:07,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:07,006 INFO L93 Difference]: Finished difference Result 19809 states and 73134 transitions. [2025-04-13 18:55:07,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:55:07,007 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:07,007 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:07,065 INFO L225 Difference]: With dead ends: 19809 [2025-04-13 18:55:07,065 INFO L226 Difference]: Without dead ends: 19727 [2025-04-13 18:55:07,072 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:55:07,072 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 261 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:07,072 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 561 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1692 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19727 states. [2025-04-13 18:55:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19727 to 10491. [2025-04-13 18:55:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10491 states, 10490 states have (on average 3.844423260247855) internal successors, (40328), 10490 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:55:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10491 states to 10491 states and 40328 transitions. [2025-04-13 18:55:07,305 INFO L79 Accepts]: Start accepts. Automaton has 10491 states and 40328 transitions. Word has length 54 [2025-04-13 18:55:07,305 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:07,305 INFO L485 AbstractCegarLoop]: Abstraction has 10491 states and 40328 transitions. [2025-04-13 18:55:07,306 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:07,306 INFO L278 IsEmpty]: Start isEmpty. Operand 10491 states and 40328 transitions. [2025-04-13 18:55:07,321 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:07,322 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:07,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:07,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2025-04-13 18:55:07,322 INFO L403 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:07,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:07,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1905493606, now seen corresponding path program 149 times [2025-04-13 18:55:07,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:07,322 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555921116] [2025-04-13 18:55:07,322 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:55:07,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:07,325 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:07,335 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:07,335 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:55:07,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:07,963 INFO L134 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:55:07,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:07,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555921116] [2025-04-13 18:55:07,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555921116] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:07,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:07,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:07,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891936529] [2025-04-13 18:55:07,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:07,964 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:07,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:07,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:07,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:07,964 INFO L87 Difference]: Start difference. First operand 10491 states and 40328 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:08,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:08,851 INFO L93 Difference]: Finished difference Result 18999 states and 70373 transitions. [2025-04-13 18:55:08,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:55:08,851 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:08,851 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:08,907 INFO L225 Difference]: With dead ends: 18999 [2025-04-13 18:55:08,908 INFO L226 Difference]: Without dead ends: 18929 [2025-04-13 18:55:08,913 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:55:08,914 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 289 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:08,914 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 530 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:08,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18929 states. [2025-04-13 18:55:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18929 to 10501. [2025-04-13 18:55:09,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10501 states, 10500 states have (on average 3.843142857142857) internal successors, (40353), 10500 states have internal predecessors, (40353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:09,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10501 states to 10501 states and 40353 transitions. [2025-04-13 18:55:09,142 INFO L79 Accepts]: Start accepts. Automaton has 10501 states and 40353 transitions. Word has length 54 [2025-04-13 18:55:09,142 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:09,142 INFO L485 AbstractCegarLoop]: Abstraction has 10501 states and 40353 transitions. [2025-04-13 18:55:09,142 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:09,142 INFO L278 IsEmpty]: Start isEmpty. Operand 10501 states and 40353 transitions. [2025-04-13 18:55:09,158 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:09,158 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:09,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:09,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2025-04-13 18:55:09,158 INFO L403 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:09,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:09,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1661980614, now seen corresponding path program 150 times [2025-04-13 18:55:09,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:09,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057429119] [2025-04-13 18:55:09,159 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:55:09,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:09,161 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:09,172 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:09,172 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:55:09,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:09,761 INFO L134 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:55:09,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:09,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057429119] [2025-04-13 18:55:09,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057429119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:09,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:09,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:09,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770652145] [2025-04-13 18:55:09,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:09,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:09,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:09,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:09,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:09,762 INFO L87 Difference]: Start difference. First operand 10501 states and 40353 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:10,733 INFO L93 Difference]: Finished difference Result 19880 states and 73317 transitions. [2025-04-13 18:55:10,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:55:10,734 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:10,734 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:10,795 INFO L225 Difference]: With dead ends: 19880 [2025-04-13 18:55:10,796 INFO L226 Difference]: Without dead ends: 19816 [2025-04-13 18:55:10,800 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:55:10,801 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 319 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:10,801 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 493 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19816 states. [2025-04-13 18:55:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19816 to 10509. [2025-04-13 18:55:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10509 states, 10508 states have (on average 3.842120289303388) internal successors, (40373), 10508 states have internal predecessors, (40373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10509 states to 10509 states and 40373 transitions. [2025-04-13 18:55:11,044 INFO L79 Accepts]: Start accepts. Automaton has 10509 states and 40373 transitions. Word has length 54 [2025-04-13 18:55:11,045 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:11,045 INFO L485 AbstractCegarLoop]: Abstraction has 10509 states and 40373 transitions. [2025-04-13 18:55:11,045 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:11,045 INFO L278 IsEmpty]: Start isEmpty. Operand 10509 states and 40373 transitions. [2025-04-13 18:55:11,060 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:11,061 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:11,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:11,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2025-04-13 18:55:11,061 INFO L403 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:11,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:11,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1468897724, now seen corresponding path program 151 times [2025-04-13 18:55:11,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:11,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249450461] [2025-04-13 18:55:11,061 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:55:11,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:11,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:11,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:11,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:55:11,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:11,646 INFO L134 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:55:11,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:11,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249450461] [2025-04-13 18:55:11,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249450461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:11,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:11,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:11,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921549001] [2025-04-13 18:55:11,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:11,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:11,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:11,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:11,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:11,647 INFO L87 Difference]: Start difference. First operand 10509 states and 40373 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:12,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:12,539 INFO L93 Difference]: Finished difference Result 18937 states and 70205 transitions. [2025-04-13 18:55:12,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:55:12,539 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:12,539 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:12,613 INFO L225 Difference]: With dead ends: 18937 [2025-04-13 18:55:12,613 INFO L226 Difference]: Without dead ends: 18855 [2025-04-13 18:55:12,621 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:55:12,622 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 287 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1579 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:12,622 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 551 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18855 states. [2025-04-13 18:55:12,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18855 to 10495. [2025-04-13 18:55:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10495 states, 10494 states have (on average 3.8437202210787116) internal successors, (40336), 10494 states have internal predecessors, (40336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10495 states to 10495 states and 40336 transitions. [2025-04-13 18:55:12,953 INFO L79 Accepts]: Start accepts. Automaton has 10495 states and 40336 transitions. Word has length 54 [2025-04-13 18:55:12,954 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:12,954 INFO L485 AbstractCegarLoop]: Abstraction has 10495 states and 40336 transitions. [2025-04-13 18:55:12,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:12,954 INFO L278 IsEmpty]: Start isEmpty. Operand 10495 states and 40336 transitions. [2025-04-13 18:55:12,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:12,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:12,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:12,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2025-04-13 18:55:12,970 INFO L403 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:12,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:12,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1187416088, now seen corresponding path program 152 times [2025-04-13 18:55:12,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:12,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568717961] [2025-04-13 18:55:12,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:55:12,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:12,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:12,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:12,985 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:55:12,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:13,561 INFO L134 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:55:13,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:13,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568717961] [2025-04-13 18:55:13,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568717961] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:13,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:13,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:13,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589249096] [2025-04-13 18:55:13,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:13,561 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:13,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:13,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:13,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:13,562 INFO L87 Difference]: Start difference. First operand 10495 states and 40336 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:14,445 INFO L93 Difference]: Finished difference Result 19802 states and 73111 transitions. [2025-04-13 18:55:14,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:55:14,445 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:14,445 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:14,506 INFO L225 Difference]: With dead ends: 19802 [2025-04-13 18:55:14,506 INFO L226 Difference]: Without dead ends: 19719 [2025-04-13 18:55:14,512 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:55:14,512 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 294 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:14,512 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 484 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19719 states. [2025-04-13 18:55:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19719 to 10483. [2025-04-13 18:55:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10483 states, 10482 states have (on average 3.8450677351650446) internal successors, (40304), 10482 states have internal predecessors, (40304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10483 states to 10483 states and 40304 transitions. [2025-04-13 18:55:14,749 INFO L79 Accepts]: Start accepts. Automaton has 10483 states and 40304 transitions. Word has length 54 [2025-04-13 18:55:14,749 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:14,749 INFO L485 AbstractCegarLoop]: Abstraction has 10483 states and 40304 transitions. [2025-04-13 18:55:14,749 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:14,749 INFO L278 IsEmpty]: Start isEmpty. Operand 10483 states and 40304 transitions. [2025-04-13 18:55:14,765 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:14,765 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:14,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:14,765 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2025-04-13 18:55:14,766 INFO L403 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:14,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:14,766 INFO L85 PathProgramCache]: Analyzing trace with hash 322205442, now seen corresponding path program 153 times [2025-04-13 18:55:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:14,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631580896] [2025-04-13 18:55:14,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:55:14,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:14,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:14,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:14,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:55:14,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:15,395 INFO L134 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:55:15,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:15,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631580896] [2025-04-13 18:55:15,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631580896] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:15,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:15,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:15,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466938103] [2025-04-13 18:55:15,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:15,395 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:15,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:15,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:15,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:15,396 INFO L87 Difference]: Start difference. First operand 10483 states and 40304 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:16,352 INFO L93 Difference]: Finished difference Result 19079 states and 70619 transitions. [2025-04-13 18:55:16,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:55:16,353 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:16,353 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:16,410 INFO L225 Difference]: With dead ends: 19079 [2025-04-13 18:55:16,410 INFO L226 Difference]: Without dead ends: 18943 [2025-04-13 18:55:16,416 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:55:16,417 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 287 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:16,417 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 538 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:16,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18943 states. [2025-04-13 18:55:16,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18943 to 10513. [2025-04-13 18:55:16,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10513 states, 10512 states have (on average 3.8412290715372905) internal successors, (40379), 10512 states have internal predecessors, (40379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10513 states to 10513 states and 40379 transitions. [2025-04-13 18:55:16,640 INFO L79 Accepts]: Start accepts. Automaton has 10513 states and 40379 transitions. Word has length 54 [2025-04-13 18:55:16,640 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:16,640 INFO L485 AbstractCegarLoop]: Abstraction has 10513 states and 40379 transitions. [2025-04-13 18:55:16,640 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:16,640 INFO L278 IsEmpty]: Start isEmpty. Operand 10513 states and 40379 transitions. [2025-04-13 18:55:16,655 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:16,655 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:16,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:16,656 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2025-04-13 18:55:16,656 INFO L403 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:16,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1405621098, now seen corresponding path program 154 times [2025-04-13 18:55:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:16,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562005352] [2025-04-13 18:55:16,656 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:55:16,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:16,659 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:55:16,671 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:16,671 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:55:16,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:17,240 INFO L134 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:55:17,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:17,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562005352] [2025-04-13 18:55:17,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562005352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:17,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:17,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:17,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647911578] [2025-04-13 18:55:17,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:17,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:17,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:17,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:17,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:17,241 INFO L87 Difference]: Start difference. First operand 10513 states and 40379 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:18,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:18,281 INFO L93 Difference]: Finished difference Result 19949 states and 73524 transitions. [2025-04-13 18:55:18,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:55:18,281 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:18,281 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:18,341 INFO L225 Difference]: With dead ends: 19949 [2025-04-13 18:55:18,341 INFO L226 Difference]: Without dead ends: 19837 [2025-04-13 18:55:18,347 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:55:18,348 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 287 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:18,348 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 588 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:55:18,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19837 states. [2025-04-13 18:55:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19837 to 10537. [2025-04-13 18:55:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10537 states, 10536 states have (on average 3.838173880030372) internal successors, (40439), 10536 states have internal predecessors, (40439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10537 states to 10537 states and 40439 transitions. [2025-04-13 18:55:18,590 INFO L79 Accepts]: Start accepts. Automaton has 10537 states and 40439 transitions. Word has length 54 [2025-04-13 18:55:18,590 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:18,590 INFO L485 AbstractCegarLoop]: Abstraction has 10537 states and 40439 transitions. [2025-04-13 18:55:18,590 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:18,591 INFO L278 IsEmpty]: Start isEmpty. Operand 10537 states and 40439 transitions. [2025-04-13 18:55:18,606 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:18,606 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:18,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:55:18,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2025-04-13 18:55:18,607 INFO L403 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:18,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:18,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1215213788, now seen corresponding path program 155 times [2025-04-13 18:55:18,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:18,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197851565] [2025-04-13 18:55:18,607 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:55:18,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:18,609 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:18,620 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:18,620 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:55:18,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:55:19,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:19,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197851565] [2025-04-13 18:55:19,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197851565] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:19,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:19,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:19,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356083645] [2025-04-13 18:55:19,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:19,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:19,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:19,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:19,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:19,220 INFO L87 Difference]: Start difference. First operand 10537 states and 40439 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:20,198 INFO L93 Difference]: Finished difference Result 19045 states and 70484 transitions. [2025-04-13 18:55:20,198 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:55:20,198 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:20,198 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:20,256 INFO L225 Difference]: With dead ends: 19045 [2025-04-13 18:55:20,257 INFO L226 Difference]: Without dead ends: 18975 [2025-04-13 18:55:20,263 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:55:20,263 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 314 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:20,263 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 518 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18975 states. [2025-04-13 18:55:20,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18975 to 10547. [2025-04-13 18:55:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10547 states, 10546 states have (on average 3.8369049876730514) internal successors, (40464), 10546 states have internal predecessors, (40464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10547 states to 10547 states and 40464 transitions. [2025-04-13 18:55:20,491 INFO L79 Accepts]: Start accepts. Automaton has 10547 states and 40464 transitions. Word has length 54 [2025-04-13 18:55:20,491 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:20,491 INFO L485 AbstractCegarLoop]: Abstraction has 10547 states and 40464 transitions. [2025-04-13 18:55:20,491 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:20,491 INFO L278 IsEmpty]: Start isEmpty. Operand 10547 states and 40464 transitions. [2025-04-13 18:55:20,507 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:20,507 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:20,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:20,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2025-04-13 18:55:20,507 INFO L403 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:20,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:20,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1015827640, now seen corresponding path program 156 times [2025-04-13 18:55:20,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:20,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539272891] [2025-04-13 18:55:20,508 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:55:20,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:20,511 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:20,520 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:20,520 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:55:20,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:21,111 INFO L134 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:55:21,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:21,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539272891] [2025-04-13 18:55:21,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539272891] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:21,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:21,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:21,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738284248] [2025-04-13 18:55:21,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:21,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:21,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:21,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:21,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:21,112 INFO L87 Difference]: Start difference. First operand 10547 states and 40464 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:22,063 INFO L93 Difference]: Finished difference Result 19926 states and 73428 transitions. [2025-04-13 18:55:22,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:55:22,063 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:22,063 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:22,124 INFO L225 Difference]: With dead ends: 19926 [2025-04-13 18:55:22,124 INFO L226 Difference]: Without dead ends: 19862 [2025-04-13 18:55:22,130 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:55:22,131 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 296 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:22,131 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 540 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:22,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19862 states. [2025-04-13 18:55:22,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19862 to 10555. [2025-04-13 18:55:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10555 states, 10554 states have (on average 3.8358916050786434) internal successors, (40484), 10554 states have internal predecessors, (40484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10555 states to 10555 states and 40484 transitions. [2025-04-13 18:55:22,428 INFO L79 Accepts]: Start accepts. Automaton has 10555 states and 40484 transitions. Word has length 54 [2025-04-13 18:55:22,429 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:22,429 INFO L485 AbstractCegarLoop]: Abstraction has 10555 states and 40484 transitions. [2025-04-13 18:55:22,429 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:22,429 INFO L278 IsEmpty]: Start isEmpty. Operand 10555 states and 40484 transitions. [2025-04-13 18:55:22,444 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:22,444 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:22,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:22,445 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2025-04-13 18:55:22,445 INFO L403 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:22,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash -294637822, now seen corresponding path program 157 times [2025-04-13 18:55:22,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:22,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530098215] [2025-04-13 18:55:22,445 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:55:22,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:22,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:22,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:22,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:55:22,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:23,064 INFO L134 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:55:23,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:23,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530098215] [2025-04-13 18:55:23,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530098215] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:23,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:23,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:23,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276625963] [2025-04-13 18:55:23,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:23,064 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:23,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:23,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:23,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:23,065 INFO L87 Difference]: Start difference. First operand 10555 states and 40484 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:23,947 INFO L93 Difference]: Finished difference Result 18983 states and 70316 transitions. [2025-04-13 18:55:23,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:55:23,948 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:23,948 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:24,014 INFO L225 Difference]: With dead ends: 18983 [2025-04-13 18:55:24,014 INFO L226 Difference]: Without dead ends: 18863 [2025-04-13 18:55:24,021 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:55:24,021 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 299 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:24,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 514 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18863 states. [2025-04-13 18:55:24,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18863 to 10503. [2025-04-13 18:55:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10503 states, 10502 states have (on average 3.8411731098838318) internal successors, (40340), 10502 states have internal predecessors, (40340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10503 states to 10503 states and 40340 transitions. [2025-04-13 18:55:24,276 INFO L79 Accepts]: Start accepts. Automaton has 10503 states and 40340 transitions. Word has length 54 [2025-04-13 18:55:24,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:24,276 INFO L485 AbstractCegarLoop]: Abstraction has 10503 states and 40340 transitions. [2025-04-13 18:55:24,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:24,276 INFO L278 IsEmpty]: Start isEmpty. Operand 10503 states and 40340 transitions. [2025-04-13 18:55:24,293 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:24,293 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:24,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:24,293 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2025-04-13 18:55:24,293 INFO L403 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:24,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:24,294 INFO L85 PathProgramCache]: Analyzing trace with hash -429742954, now seen corresponding path program 158 times [2025-04-13 18:55:24,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:24,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655384679] [2025-04-13 18:55:24,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:55:24,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:24,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:24,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:24,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:55:24,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:24,928 INFO L134 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:55:24,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:24,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655384679] [2025-04-13 18:55:24,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655384679] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:24,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:24,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:24,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107228945] [2025-04-13 18:55:24,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:24,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:24,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:24,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:24,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:24,929 INFO L87 Difference]: Start difference. First operand 10503 states and 40340 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:25,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:25,796 INFO L93 Difference]: Finished difference Result 19810 states and 73115 transitions. [2025-04-13 18:55:25,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:55:25,796 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:25,796 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:25,857 INFO L225 Difference]: With dead ends: 19810 [2025-04-13 18:55:25,857 INFO L226 Difference]: Without dead ends: 19695 [2025-04-13 18:55:25,863 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:55:25,864 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 294 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:25,864 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 490 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19695 states. [2025-04-13 18:55:26,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19695 to 10459. [2025-04-13 18:55:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10459 states, 10458 states have (on average 3.845477146681966) internal successors, (40216), 10458 states have internal predecessors, (40216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10459 states to 10459 states and 40216 transitions. [2025-04-13 18:55:26,103 INFO L79 Accepts]: Start accepts. Automaton has 10459 states and 40216 transitions. Word has length 54 [2025-04-13 18:55:26,104 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:26,104 INFO L485 AbstractCegarLoop]: Abstraction has 10459 states and 40216 transitions. [2025-04-13 18:55:26,104 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:26,104 INFO L278 IsEmpty]: Start isEmpty. Operand 10459 states and 40216 transitions. [2025-04-13 18:55:26,120 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:26,120 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:26,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] [2025-04-13 18:55:26,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2025-04-13 18:55:26,120 INFO L403 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:26,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:26,121 INFO L85 PathProgramCache]: Analyzing trace with hash -749088332, now seen corresponding path program 159 times [2025-04-13 18:55:26,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:26,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840955744] [2025-04-13 18:55:26,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:55:26,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:26,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:26,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:26,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:55:26,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:26,748 INFO L134 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:55:26,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:26,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840955744] [2025-04-13 18:55:26,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840955744] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:26,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:26,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:26,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882112261] [2025-04-13 18:55:26,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:26,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:26,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:26,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:26,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:26,749 INFO L87 Difference]: Start difference. First operand 10459 states and 40216 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:27,746 INFO L93 Difference]: Finished difference Result 19231 states and 71103 transitions. [2025-04-13 18:55:27,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:55:27,747 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:27,747 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:27,805 INFO L225 Difference]: With dead ends: 19231 [2025-04-13 18:55:27,805 INFO L226 Difference]: Without dead ends: 19167 [2025-04-13 18:55:27,810 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=513, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:55:27,811 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 312 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:27,811 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 574 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19167 states. [2025-04-13 18:55:27,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19167 to 10479. [2025-04-13 18:55:27,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10479 states, 10478 states have (on average 3.8446268371826684) internal successors, (40284), 10478 states have internal predecessors, (40284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:28,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10479 states to 10479 states and 40284 transitions. [2025-04-13 18:55:28,036 INFO L79 Accepts]: Start accepts. Automaton has 10479 states and 40284 transitions. Word has length 54 [2025-04-13 18:55:28,036 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:28,036 INFO L485 AbstractCegarLoop]: Abstraction has 10479 states and 40284 transitions. [2025-04-13 18:55:28,036 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:28,036 INFO L278 IsEmpty]: Start isEmpty. Operand 10479 states and 40284 transitions. [2025-04-13 18:55:28,052 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:28,052 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:28,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] [2025-04-13 18:55:28,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2025-04-13 18:55:28,052 INFO L403 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:28,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1742597368, now seen corresponding path program 160 times [2025-04-13 18:55:28,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:28,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409989924] [2025-04-13 18:55:28,053 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:55:28,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:28,055 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:55:28,068 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:28,068 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:55:28,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:28,685 INFO L134 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:55:28,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:28,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409989924] [2025-04-13 18:55:28,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409989924] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:28,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:28,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:28,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816785409] [2025-04-13 18:55:28,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:28,686 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:28,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:28,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:28,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:28,686 INFO L87 Difference]: Start difference. First operand 10479 states and 40284 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:29,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:29,746 INFO L93 Difference]: Finished difference Result 20201 states and 74314 transitions. [2025-04-13 18:55:29,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:55:29,746 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:29,746 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:29,808 INFO L225 Difference]: With dead ends: 20201 [2025-04-13 18:55:29,808 INFO L226 Difference]: Without dead ends: 20131 [2025-04-13 18:55:29,815 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=511, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:55:29,815 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 300 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:29,815 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 572 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:55:29,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20131 states. [2025-04-13 18:55:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20131 to 10499. [2025-04-13 18:55:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10499 states, 10498 states have (on average 3.8437797675747762) internal successors, (40352), 10498 states have internal predecessors, (40352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:30,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10499 states to 10499 states and 40352 transitions. [2025-04-13 18:55:30,054 INFO L79 Accepts]: Start accepts. Automaton has 10499 states and 40352 transitions. Word has length 54 [2025-04-13 18:55:30,054 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:30,054 INFO L485 AbstractCegarLoop]: Abstraction has 10499 states and 40352 transitions. [2025-04-13 18:55:30,054 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:30,054 INFO L278 IsEmpty]: Start isEmpty. Operand 10499 states and 40352 transitions. [2025-04-13 18:55:30,071 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:30,071 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:30,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:55:30,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2025-04-13 18:55:30,071 INFO L403 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:30,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:30,072 INFO L85 PathProgramCache]: Analyzing trace with hash 220573588, now seen corresponding path program 161 times [2025-04-13 18:55:30,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:30,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456030048] [2025-04-13 18:55:30,072 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:55:30,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:30,074 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:30,085 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:30,085 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:55:30,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:55:30,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:30,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456030048] [2025-04-13 18:55:30,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456030048] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:30,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:30,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:30,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627930870] [2025-04-13 18:55:30,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:30,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:30,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:30,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:30,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:30,708 INFO L87 Difference]: Start difference. First operand 10499 states and 40352 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:31,744 INFO L93 Difference]: Finished difference Result 19209 states and 71036 transitions. [2025-04-13 18:55:31,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:55:31,744 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:31,744 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:31,806 INFO L225 Difference]: With dead ends: 19209 [2025-04-13 18:55:31,806 INFO L226 Difference]: Without dead ends: 19131 [2025-04-13 18:55:31,811 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=476, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:55:31,811 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 316 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:31,811 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 545 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:31,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19131 states. [2025-04-13 18:55:31,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19131 to 10491. [2025-04-13 18:55:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10491 states, 10490 states have (on average 3.844423260247855) internal successors, (40328), 10490 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:55:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10491 states to 10491 states and 40328 transitions. [2025-04-13 18:55:32,028 INFO L79 Accepts]: Start accepts. Automaton has 10491 states and 40328 transitions. Word has length 54 [2025-04-13 18:55:32,028 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:32,028 INFO L485 AbstractCegarLoop]: Abstraction has 10491 states and 40328 transitions. [2025-04-13 18:55:32,028 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:32,028 INFO L278 IsEmpty]: Start isEmpty. Operand 10491 states and 40328 transitions. [2025-04-13 18:55:32,044 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:32,044 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:32,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:32,045 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2025-04-13 18:55:32,045 INFO L403 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:32,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:32,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1582708008, now seen corresponding path program 162 times [2025-04-13 18:55:32,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:32,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363021484] [2025-04-13 18:55:32,045 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:55:32,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:32,048 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:32,057 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:32,057 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:55:32,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:32,667 INFO L134 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:55:32,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:32,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363021484] [2025-04-13 18:55:32,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363021484] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:32,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:32,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:32,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745607974] [2025-04-13 18:55:32,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:32,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:32,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:32,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:32,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:32,668 INFO L87 Difference]: Start difference. First operand 10491 states and 40328 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:33,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:33,663 INFO L93 Difference]: Finished difference Result 20121 states and 74070 transitions. [2025-04-13 18:55:33,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:55:33,663 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:33,663 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:33,725 INFO L225 Difference]: With dead ends: 20121 [2025-04-13 18:55:33,725 INFO L226 Difference]: Without dead ends: 20049 [2025-04-13 18:55:33,731 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:55:33,731 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 331 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:33,731 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 517 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:55:33,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20049 states. [2025-04-13 18:55:33,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20049 to 10483. [2025-04-13 18:55:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10483 states, 10482 states have (on average 3.8450677351650446) internal successors, (40304), 10482 states have internal predecessors, (40304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10483 states to 10483 states and 40304 transitions. [2025-04-13 18:55:34,032 INFO L79 Accepts]: Start accepts. Automaton has 10483 states and 40304 transitions. Word has length 54 [2025-04-13 18:55:34,032 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:34,032 INFO L485 AbstractCegarLoop]: Abstraction has 10483 states and 40304 transitions. [2025-04-13 18:55:34,032 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:34,032 INFO L278 IsEmpty]: Start isEmpty. Operand 10483 states and 40304 transitions. [2025-04-13 18:55:34,048 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:34,048 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:34,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:34,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2025-04-13 18:55:34,048 INFO L403 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:34,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:34,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2018962838, now seen corresponding path program 163 times [2025-04-13 18:55:34,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:34,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505380474] [2025-04-13 18:55:34,049 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:55:34,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:34,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:34,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:34,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:55:34,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:55:34,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:34,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505380474] [2025-04-13 18:55:34,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505380474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:34,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:34,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:34,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637534774] [2025-04-13 18:55:34,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:34,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:34,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:34,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:34,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:34,684 INFO L87 Difference]: Start difference. First operand 10483 states and 40304 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:35,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:35,549 INFO L93 Difference]: Finished difference Result 19191 states and 70944 transitions. [2025-04-13 18:55:35,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:55:35,550 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:35,550 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:35,609 INFO L225 Difference]: With dead ends: 19191 [2025-04-13 18:55:35,609 INFO L226 Difference]: Without dead ends: 19127 [2025-04-13 18:55:35,616 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=442, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:55:35,616 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 346 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:35,616 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 480 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19127 states. [2025-04-13 18:55:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19127 to 10491. [2025-04-13 18:55:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10491 states, 10490 states have (on average 3.844041944709247) internal successors, (40324), 10490 states have internal predecessors, (40324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:35,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10491 states to 10491 states and 40324 transitions. [2025-04-13 18:55:35,838 INFO L79 Accepts]: Start accepts. Automaton has 10491 states and 40324 transitions. Word has length 54 [2025-04-13 18:55:35,838 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:35,838 INFO L485 AbstractCegarLoop]: Abstraction has 10491 states and 40324 transitions. [2025-04-13 18:55:35,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:35,838 INFO L278 IsEmpty]: Start isEmpty. Operand 10491 states and 40324 transitions. [2025-04-13 18:55:35,853 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:35,854 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:35,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] [2025-04-13 18:55:35,854 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2025-04-13 18:55:35,854 INFO L403 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:35,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:35,854 INFO L85 PathProgramCache]: Analyzing trace with hash 689354474, now seen corresponding path program 164 times [2025-04-13 18:55:35,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:35,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968136621] [2025-04-13 18:55:35,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:55:35,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:35,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:35,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:35,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:55:35,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:36,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:55:36,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:36,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968136621] [2025-04-13 18:55:36,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968136621] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:36,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:36,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:36,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230725805] [2025-04-13 18:55:36,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:36,482 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:36,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:36,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:36,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:36,482 INFO L87 Difference]: Start difference. First operand 10491 states and 40324 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:37,375 INFO L93 Difference]: Finished difference Result 20119 states and 74022 transitions. [2025-04-13 18:55:37,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:55:37,375 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:37,375 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:37,435 INFO L225 Difference]: With dead ends: 20119 [2025-04-13 18:55:37,435 INFO L226 Difference]: Without dead ends: 20049 [2025-04-13 18:55:37,441 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=440, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:55:37,441 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 337 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:37,441 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 481 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20049 states. [2025-04-13 18:55:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20049 to 10502. [2025-04-13 18:55:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10502 states, 10501 states have (on average 3.84258642034092) internal successors, (40351), 10501 states have internal predecessors, (40351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10502 states to 10502 states and 40351 transitions. [2025-04-13 18:55:37,676 INFO L79 Accepts]: Start accepts. Automaton has 10502 states and 40351 transitions. Word has length 54 [2025-04-13 18:55:37,676 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:37,676 INFO L485 AbstractCegarLoop]: Abstraction has 10502 states and 40351 transitions. [2025-04-13 18:55:37,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:37,676 INFO L278 IsEmpty]: Start isEmpty. Operand 10502 states and 40351 transitions. [2025-04-13 18:55:37,692 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:37,692 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:37,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:37,692 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2025-04-13 18:55:37,693 INFO L403 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:37,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:37,693 INFO L85 PathProgramCache]: Analyzing trace with hash -391018124, now seen corresponding path program 165 times [2025-04-13 18:55:37,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:37,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728457662] [2025-04-13 18:55:37,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:55:37,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:37,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:37,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:37,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:55:37,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:38,349 INFO L134 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:55:38,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:38,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728457662] [2025-04-13 18:55:38,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728457662] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:38,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:38,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:38,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916754027] [2025-04-13 18:55:38,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:38,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:38,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:38,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:38,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:38,350 INFO L87 Difference]: Start difference. First operand 10502 states and 40351 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:39,237 INFO L93 Difference]: Finished difference Result 19158 states and 70862 transitions. [2025-04-13 18:55:39,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:55:39,237 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:39,237 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:39,296 INFO L225 Difference]: With dead ends: 19158 [2025-04-13 18:55:39,296 INFO L226 Difference]: Without dead ends: 19082 [2025-04-13 18:55:39,302 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=442, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:55:39,302 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 294 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:39,302 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 548 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1554 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:39,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19082 states. [2025-04-13 18:55:39,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19082 to 10494. [2025-04-13 18:55:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10494 states, 10493 states have (on average 3.8432288192128086) internal successors, (40327), 10493 states have internal predecessors, (40327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10494 states to 10494 states and 40327 transitions. [2025-04-13 18:55:39,525 INFO L79 Accepts]: Start accepts. Automaton has 10494 states and 40327 transitions. Word has length 54 [2025-04-13 18:55:39,525 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:39,525 INFO L485 AbstractCegarLoop]: Abstraction has 10494 states and 40327 transitions. [2025-04-13 18:55:39,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:39,526 INFO L278 IsEmpty]: Start isEmpty. Operand 10494 states and 40327 transitions. [2025-04-13 18:55:39,541 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:39,541 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:39,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:39,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2025-04-13 18:55:39,541 INFO L403 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:39,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:39,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1720626488, now seen corresponding path program 166 times [2025-04-13 18:55:39,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:39,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408827766] [2025-04-13 18:55:39,542 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:55:39,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:39,544 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:55:39,557 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:39,557 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:55:39,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:40,160 INFO L134 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:55:40,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:40,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408827766] [2025-04-13 18:55:40,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408827766] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:40,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:40,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:40,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036461417] [2025-04-13 18:55:40,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:40,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:40,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:40,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:40,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:40,161 INFO L87 Difference]: Start difference. First operand 10494 states and 40327 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:41,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:41,071 INFO L93 Difference]: Finished difference Result 20064 states and 73876 transitions. [2025-04-13 18:55:41,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:55:41,072 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:41,072 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:41,133 INFO L225 Difference]: With dead ends: 20064 [2025-04-13 18:55:41,134 INFO L226 Difference]: Without dead ends: 19982 [2025-04-13 18:55:41,140 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=440, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:55:41,141 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 327 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:41,141 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 481 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19982 states. [2025-04-13 18:55:41,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19982 to 10483. [2025-04-13 18:55:41,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10483 states, 10482 states have (on average 3.844304522037779) internal successors, (40296), 10482 states have internal predecessors, (40296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10483 states to 10483 states and 40296 transitions. [2025-04-13 18:55:41,387 INFO L79 Accepts]: Start accepts. Automaton has 10483 states and 40296 transitions. Word has length 54 [2025-04-13 18:55:41,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:41,387 INFO L485 AbstractCegarLoop]: Abstraction has 10483 states and 40296 transitions. [2025-04-13 18:55:41,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:41,387 INFO L278 IsEmpty]: Start isEmpty. Operand 10483 states and 40296 transitions. [2025-04-13 18:55:41,403 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:41,403 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:41,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] [2025-04-13 18:55:41,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2025-04-13 18:55:41,403 INFO L403 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:41,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:41,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1474392202, now seen corresponding path program 167 times [2025-04-13 18:55:41,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:41,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394227946] [2025-04-13 18:55:41,404 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:55:41,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:41,406 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:41,417 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:41,417 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:55:41,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:55:42,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:42,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394227946] [2025-04-13 18:55:42,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394227946] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:42,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:42,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:42,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71676829] [2025-04-13 18:55:42,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:42,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:42,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:42,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:42,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:42,033 INFO L87 Difference]: Start difference. First operand 10483 states and 40296 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:43,053 INFO L93 Difference]: Finished difference Result 19199 states and 70960 transitions. [2025-04-13 18:55:43,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:55:43,054 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:43,054 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:43,115 INFO L225 Difference]: With dead ends: 19199 [2025-04-13 18:55:43,115 INFO L226 Difference]: Without dead ends: 19129 [2025-04-13 18:55:43,120 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=441, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:55:43,120 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 322 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:43,121 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 562 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:43,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19129 states. [2025-04-13 18:55:43,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19129 to 10493. [2025-04-13 18:55:43,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10493 states, 10492 states have (on average 3.8430232558139537) internal successors, (40321), 10492 states have internal predecessors, (40321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10493 states to 10493 states and 40321 transitions. [2025-04-13 18:55:43,346 INFO L79 Accepts]: Start accepts. Automaton has 10493 states and 40321 transitions. Word has length 54 [2025-04-13 18:55:43,347 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:43,347 INFO L485 AbstractCegarLoop]: Abstraction has 10493 states and 40321 transitions. [2025-04-13 18:55:43,347 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:43,347 INFO L278 IsEmpty]: Start isEmpty. Operand 10493 states and 40321 transitions. [2025-04-13 18:55:43,363 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:43,363 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:43,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:43,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2025-04-13 18:55:43,363 INFO L403 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:43,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:43,363 INFO L85 PathProgramCache]: Analyzing trace with hash -112257782, now seen corresponding path program 168 times [2025-04-13 18:55:43,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:43,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535084807] [2025-04-13 18:55:43,364 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:55:43,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:43,366 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:43,377 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:43,377 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:55:43,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:43,968 INFO L134 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:55:43,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:43,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535084807] [2025-04-13 18:55:43,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535084807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:43,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:43,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:43,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016991425] [2025-04-13 18:55:43,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:43,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:43,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:43,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:43,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:43,969 INFO L87 Difference]: Start difference. First operand 10493 states and 40321 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:44,880 INFO L93 Difference]: Finished difference Result 20112 states and 73992 transitions. [2025-04-13 18:55:44,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:55:44,880 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:44,880 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:44,960 INFO L225 Difference]: With dead ends: 20112 [2025-04-13 18:55:44,960 INFO L226 Difference]: Without dead ends: 20048 [2025-04-13 18:55:44,966 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=440, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:55:44,967 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 351 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:44,967 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 484 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20048 states. [2025-04-13 18:55:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20048 to 10501. [2025-04-13 18:55:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10501 states, 10500 states have (on average 3.842) internal successors, (40341), 10500 states have internal predecessors, (40341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10501 states to 10501 states and 40341 transitions. [2025-04-13 18:55:45,264 INFO L79 Accepts]: Start accepts. Automaton has 10501 states and 40341 transitions. Word has length 54 [2025-04-13 18:55:45,264 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:45,264 INFO L485 AbstractCegarLoop]: Abstraction has 10501 states and 40341 transitions. [2025-04-13 18:55:45,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:45,265 INFO L278 IsEmpty]: Start isEmpty. Operand 10501 states and 40341 transitions. [2025-04-13 18:55:45,280 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:45,280 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:45,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:45,281 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2025-04-13 18:55:45,281 INFO L403 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:45,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:45,281 INFO L85 PathProgramCache]: Analyzing trace with hash -553816236, now seen corresponding path program 169 times [2025-04-13 18:55:45,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:45,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349571104] [2025-04-13 18:55:45,281 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:55:45,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:45,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:45,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:45,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:55:45,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:45,904 INFO L134 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:55:45,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:45,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349571104] [2025-04-13 18:55:45,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349571104] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:45,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:45,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:45,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868308692] [2025-04-13 18:55:45,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:45,905 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:45,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:45,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:45,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:45,905 INFO L87 Difference]: Start difference. First operand 10501 states and 40341 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:46,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:46,819 INFO L93 Difference]: Finished difference Result 19157 states and 70852 transitions. [2025-04-13 18:55:46,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:55:46,819 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:46,819 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:46,880 INFO L225 Difference]: With dead ends: 19157 [2025-04-13 18:55:46,881 INFO L226 Difference]: Without dead ends: 19075 [2025-04-13 18:55:46,886 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=442, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:55:46,887 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 295 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:46,887 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 534 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:46,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19075 states. [2025-04-13 18:55:47,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19075 to 10487. [2025-04-13 18:55:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10487 states, 10486 states have (on average 3.8436009917985885) internal successors, (40304), 10486 states have internal predecessors, (40304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10487 states to 10487 states and 40304 transitions. [2025-04-13 18:55:47,110 INFO L79 Accepts]: Start accepts. Automaton has 10487 states and 40304 transitions. Word has length 54 [2025-04-13 18:55:47,110 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:47,110 INFO L485 AbstractCegarLoop]: Abstraction has 10487 states and 40304 transitions. [2025-04-13 18:55:47,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:47,111 INFO L278 IsEmpty]: Start isEmpty. Operand 10487 states and 40304 transitions. [2025-04-13 18:55:47,126 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:47,127 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:47,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:47,127 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2025-04-13 18:55:47,127 INFO L403 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:47,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:47,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1557828376, now seen corresponding path program 170 times [2025-04-13 18:55:47,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:47,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131754009] [2025-04-13 18:55:47,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:55:47,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:47,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:47,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:47,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:55:47,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:47,793 INFO L134 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:55:47,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:47,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131754009] [2025-04-13 18:55:47,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131754009] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:47,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:47,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:47,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918433012] [2025-04-13 18:55:47,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:47,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:47,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:47,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:47,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:47,794 INFO L87 Difference]: Start difference. First operand 10487 states and 40304 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:48,680 INFO L93 Difference]: Finished difference Result 20057 states and 73853 transitions. [2025-04-13 18:55:48,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:55:48,681 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:48,681 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:48,740 INFO L225 Difference]: With dead ends: 20057 [2025-04-13 18:55:48,740 INFO L226 Difference]: Without dead ends: 19974 [2025-04-13 18:55:48,746 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=440, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:55:48,746 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 351 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:48,746 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 467 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:48,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19974 states. [2025-04-13 18:55:48,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19974 to 10475. [2025-04-13 18:55:48,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10475 states, 10474 states have (on average 3.8449493985105976) internal successors, (40272), 10474 states have internal predecessors, (40272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10475 states to 10475 states and 40272 transitions. [2025-04-13 18:55:48,988 INFO L79 Accepts]: Start accepts. Automaton has 10475 states and 40272 transitions. Word has length 54 [2025-04-13 18:55:48,988 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:48,988 INFO L485 AbstractCegarLoop]: Abstraction has 10475 states and 40272 transitions. [2025-04-13 18:55:48,988 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:48,988 INFO L278 IsEmpty]: Start isEmpty. Operand 10475 states and 40272 transitions. [2025-04-13 18:55:49,004 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:49,004 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:49,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:49,004 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2025-04-13 18:55:49,004 INFO L403 AbstractCegarLoop]: === Iteration 171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:49,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:49,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2121566940, now seen corresponding path program 171 times [2025-04-13 18:55:49,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:49,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458619123] [2025-04-13 18:55:49,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:55:49,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:49,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:49,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:49,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:55:49,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:49,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:55:49,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:49,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458619123] [2025-04-13 18:55:49,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458619123] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:49,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:49,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:49,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537036275] [2025-04-13 18:55:49,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:49,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:49,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:49,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:49,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:49,605 INFO L87 Difference]: Start difference. First operand 10475 states and 40272 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:50,583 INFO L93 Difference]: Finished difference Result 19059 states and 70594 transitions. [2025-04-13 18:55:50,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:55:50,584 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:50,584 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:50,642 INFO L225 Difference]: With dead ends: 19059 [2025-04-13 18:55:50,643 INFO L226 Difference]: Without dead ends: 18995 [2025-04-13 18:55:50,649 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=508, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:55:50,649 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 281 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:50,649 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 511 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18995 states. [2025-04-13 18:55:50,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18995 to 10499. [2025-04-13 18:55:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10499 states, 10498 states have (on average 3.8433987426176413) internal successors, (40348), 10498 states have internal predecessors, (40348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10499 states to 10499 states and 40348 transitions. [2025-04-13 18:55:50,875 INFO L79 Accepts]: Start accepts. Automaton has 10499 states and 40348 transitions. Word has length 54 [2025-04-13 18:55:50,875 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:50,875 INFO L485 AbstractCegarLoop]: Abstraction has 10499 states and 40348 transitions. [2025-04-13 18:55:50,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:50,875 INFO L278 IsEmpty]: Start isEmpty. Operand 10499 states and 40348 transitions. [2025-04-13 18:55:50,891 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:50,891 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:50,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:50,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2025-04-13 18:55:50,892 INFO L403 AbstractCegarLoop]: === Iteration 172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:50,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:50,892 INFO L85 PathProgramCache]: Analyzing trace with hash -659756360, now seen corresponding path program 172 times [2025-04-13 18:55:50,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:50,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532753245] [2025-04-13 18:55:50,892 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:55:50,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:50,894 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:55:50,907 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:50,907 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:55:50,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:55:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:51,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532753245] [2025-04-13 18:55:51,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532753245] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:51,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:51,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916748699] [2025-04-13 18:55:51,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:51,507 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:51,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:51,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:51,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:51,507 INFO L87 Difference]: Start difference. First operand 10499 states and 40348 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:52,672 INFO L93 Difference]: Finished difference Result 20017 states and 73769 transitions. [2025-04-13 18:55:52,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:55:52,672 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:52,672 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:52,734 INFO L225 Difference]: With dead ends: 20017 [2025-04-13 18:55:52,734 INFO L226 Difference]: Without dead ends: 19947 [2025-04-13 18:55:52,741 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=507, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:55:52,741 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 280 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:52,741 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 582 Invalid, 1780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:55:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19947 states. [2025-04-13 18:55:52,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19947 to 10532. [2025-04-13 18:55:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10532 states, 10531 states have (on average 3.841135694615896) internal successors, (40451), 10531 states have internal predecessors, (40451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10532 states to 10532 states and 40451 transitions. [2025-04-13 18:55:52,993 INFO L79 Accepts]: Start accepts. Automaton has 10532 states and 40451 transitions. Word has length 54 [2025-04-13 18:55:52,994 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:52,994 INFO L485 AbstractCegarLoop]: Abstraction has 10532 states and 40451 transitions. [2025-04-13 18:55:52,994 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:52,994 INFO L278 IsEmpty]: Start isEmpty. Operand 10532 states and 40451 transitions. [2025-04-13 18:55:53,010 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:53,010 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:53,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:53,010 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2025-04-13 18:55:53,010 INFO L403 AbstractCegarLoop]: === Iteration 173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:53,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:53,011 INFO L85 PathProgramCache]: Analyzing trace with hash -236580606, now seen corresponding path program 173 times [2025-04-13 18:55:53,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:53,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877872664] [2025-04-13 18:55:53,011 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:55:53,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:53,013 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:53,023 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:53,024 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:55:53,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:53,580 INFO L134 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:55:53,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:53,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877872664] [2025-04-13 18:55:53,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877872664] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:53,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:53,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:53,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32517333] [2025-04-13 18:55:53,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:53,580 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:53,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:53,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:53,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:53,581 INFO L87 Difference]: Start difference. First operand 10532 states and 40451 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:54,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:54,537 INFO L93 Difference]: Finished difference Result 19048 states and 70557 transitions. [2025-04-13 18:55:54,537 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:55:54,537 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:54,537 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:54,672 INFO L225 Difference]: With dead ends: 19048 [2025-04-13 18:55:54,673 INFO L226 Difference]: Without dead ends: 18972 [2025-04-13 18:55:54,675 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:55:54,676 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 291 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:54,676 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 502 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18972 states. [2025-04-13 18:55:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18972 to 10524. [2025-04-13 18:55:54,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10524 states, 10523 states have (on average 3.841395039437423) internal successors, (40423), 10523 states have internal predecessors, (40423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10524 states to 10524 states and 40423 transitions. [2025-04-13 18:55:54,878 INFO L79 Accepts]: Start accepts. Automaton has 10524 states and 40423 transitions. Word has length 54 [2025-04-13 18:55:54,878 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:54,878 INFO L485 AbstractCegarLoop]: Abstraction has 10524 states and 40423 transitions. [2025-04-13 18:55:54,878 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:54,878 INFO L278 IsEmpty]: Start isEmpty. Operand 10524 states and 40423 transitions. [2025-04-13 18:55:54,894 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:54,894 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:54,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:55:54,894 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2025-04-13 18:55:54,894 INFO L403 AbstractCegarLoop]: === Iteration 174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:54,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:54,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1225229974, now seen corresponding path program 174 times [2025-04-13 18:55:54,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:54,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93579155] [2025-04-13 18:55:54,895 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:55:54,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:54,897 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:54,907 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:54,907 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:55:54,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:55,529 INFO L134 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:55:55,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:55,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93579155] [2025-04-13 18:55:55,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93579155] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:55,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:55,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:55,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448626979] [2025-04-13 18:55:55,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:55,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:55,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:55,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:55,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:55,530 INFO L87 Difference]: Start difference. First operand 10524 states and 40423 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:56,429 INFO L93 Difference]: Finished difference Result 19944 states and 73537 transitions. [2025-04-13 18:55:56,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:55:56,430 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:56,430 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:56,492 INFO L225 Difference]: With dead ends: 19944 [2025-04-13 18:55:56,492 INFO L226 Difference]: Without dead ends: 19862 [2025-04-13 18:55:56,498 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=471, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:55:56,499 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 292 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:56,499 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 510 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:56,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19862 states. [2025-04-13 18:55:56,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19862 to 10513. [2025-04-13 18:55:56,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10513 states, 10512 states have (on average 3.8417998477929984) internal successors, (40385), 10512 states have internal predecessors, (40385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10513 states to 10513 states and 40385 transitions. [2025-04-13 18:55:56,841 INFO L79 Accepts]: Start accepts. Automaton has 10513 states and 40385 transitions. Word has length 54 [2025-04-13 18:55:56,841 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:56,841 INFO L485 AbstractCegarLoop]: Abstraction has 10513 states and 40385 transitions. [2025-04-13 18:55:56,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:56,841 INFO L278 IsEmpty]: Start isEmpty. Operand 10513 states and 40385 transitions. [2025-04-13 18:55:56,860 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:56,860 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:56,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] [2025-04-13 18:55:56,860 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2025-04-13 18:55:56,860 INFO L403 AbstractCegarLoop]: === Iteration 175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:56,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:56,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1918417516, now seen corresponding path program 175 times [2025-04-13 18:55:56,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:56,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334699932] [2025-04-13 18:55:56,861 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:55:56,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:56,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:56,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:56,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:55:56,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:57,460 INFO L134 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:55:57,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:57,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334699932] [2025-04-13 18:55:57,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334699932] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:57,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:57,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:57,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509729173] [2025-04-13 18:55:57,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:57,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:57,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:57,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:57,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:57,461 INFO L87 Difference]: Start difference. First operand 10513 states and 40385 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:58,345 INFO L93 Difference]: Finished difference Result 19001 states and 70438 transitions. [2025-04-13 18:55:58,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:55:58,345 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:55:58,345 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:58,405 INFO L225 Difference]: With dead ends: 19001 [2025-04-13 18:55:58,405 INFO L226 Difference]: Without dead ends: 18877 [2025-04-13 18:55:58,412 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=470, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:55:58,412 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 278 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:58,412 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 502 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:55:58,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18877 states. [2025-04-13 18:55:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18877 to 10497. [2025-04-13 18:55:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10497 states, 10496 states have (on average 3.8423208841463414) internal successors, (40329), 10496 states have internal predecessors, (40329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10497 states to 10497 states and 40329 transitions. [2025-04-13 18:55:58,640 INFO L79 Accepts]: Start accepts. Automaton has 10497 states and 40329 transitions. Word has length 54 [2025-04-13 18:55:58,640 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:58,640 INFO L485 AbstractCegarLoop]: Abstraction has 10497 states and 40329 transitions. [2025-04-13 18:55:58,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:58,641 INFO L278 IsEmpty]: Start isEmpty. Operand 10497 states and 40329 transitions. [2025-04-13 18:55:58,656 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:55:58,656 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:58,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:58,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2025-04-13 18:55:58,657 INFO L403 AbstractCegarLoop]: === Iteration 176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:58,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:58,657 INFO L85 PathProgramCache]: Analyzing trace with hash -456606936, now seen corresponding path program 176 times [2025-04-13 18:55:58,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:58,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385291487] [2025-04-13 18:55:58,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:55:58,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:58,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:55:58,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:55:58,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:55:58,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:59,278 INFO L134 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:55:59,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:59,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385291487] [2025-04-13 18:55:59,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385291487] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:59,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:59,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:55:59,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824506989] [2025-04-13 18:55:59,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:59,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:55:59,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:59,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:55:59,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:55:59,279 INFO L87 Difference]: Start difference. First operand 10497 states and 40329 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:00,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:00,210 INFO L93 Difference]: Finished difference Result 19892 states and 73397 transitions. [2025-04-13 18:56:00,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:56:00,210 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:00,210 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:00,272 INFO L225 Difference]: With dead ends: 19892 [2025-04-13 18:56:00,272 INFO L226 Difference]: Without dead ends: 19753 [2025-04-13 18:56:00,279 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=470, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:56:00,279 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 285 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:00,279 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 511 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19753 states. [2025-04-13 18:56:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19753 to 10475. [2025-04-13 18:56:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10475 states, 10474 states have (on average 3.8434218063776973) internal successors, (40256), 10474 states have internal predecessors, (40256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10475 states to 10475 states and 40256 transitions. [2025-04-13 18:56:00,512 INFO L79 Accepts]: Start accepts. Automaton has 10475 states and 40256 transitions. Word has length 54 [2025-04-13 18:56:00,513 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:00,513 INFO L485 AbstractCegarLoop]: Abstraction has 10475 states and 40256 transitions. [2025-04-13 18:56:00,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:00,513 INFO L278 IsEmpty]: Start isEmpty. Operand 10475 states and 40256 transitions. [2025-04-13 18:56:00,529 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:00,529 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:00,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:00,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2025-04-13 18:56:00,529 INFO L403 AbstractCegarLoop]: === Iteration 177 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:00,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2071728860, now seen corresponding path program 177 times [2025-04-13 18:56:00,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:00,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228645502] [2025-04-13 18:56:00,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:56:00,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:00,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:00,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:00,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:56:00,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:01,206 INFO L134 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:56:01,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:01,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228645502] [2025-04-13 18:56:01,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228645502] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:01,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:01,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:01,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177392840] [2025-04-13 18:56:01,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:01,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:01,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:01,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:01,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:01,207 INFO L87 Difference]: Start difference. First operand 10475 states and 40256 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:02,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:02,088 INFO L93 Difference]: Finished difference Result 19063 states and 70592 transitions. [2025-04-13 18:56:02,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:56:02,088 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:02,088 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:02,146 INFO L225 Difference]: With dead ends: 19063 [2025-04-13 18:56:02,146 INFO L226 Difference]: Without dead ends: 18993 [2025-04-13 18:56:02,152 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:56:02,152 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 308 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:02,152 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 470 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18993 states. [2025-04-13 18:56:02,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18993 to 10505. [2025-04-13 18:56:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10505 states, 10504 states have (on average 3.8414889565879666) internal successors, (40351), 10504 states have internal predecessors, (40351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10505 states to 10505 states and 40351 transitions. [2025-04-13 18:56:02,382 INFO L79 Accepts]: Start accepts. Automaton has 10505 states and 40351 transitions. Word has length 54 [2025-04-13 18:56:02,382 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:02,382 INFO L485 AbstractCegarLoop]: Abstraction has 10505 states and 40351 transitions. [2025-04-13 18:56:02,382 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:02,382 INFO L278 IsEmpty]: Start isEmpty. Operand 10505 states and 40351 transitions. [2025-04-13 18:56:02,398 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:02,398 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:02,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:02,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2025-04-13 18:56:02,399 INFO L403 AbstractCegarLoop]: === Iteration 178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:02,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash -709594440, now seen corresponding path program 178 times [2025-04-13 18:56:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:02,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987384149] [2025-04-13 18:56:02,399 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:56:02,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:02,402 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:56:02,413 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:02,413 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:56:02,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:03,019 INFO L134 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:56:03,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:03,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987384149] [2025-04-13 18:56:03,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987384149] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:03,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:03,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:03,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427968508] [2025-04-13 18:56:03,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:03,020 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:03,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:03,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:03,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:03,020 INFO L87 Difference]: Start difference. First operand 10505 states and 40351 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:04,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:04,127 INFO L93 Difference]: Finished difference Result 19988 states and 73664 transitions. [2025-04-13 18:56:04,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:56:04,127 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:04,127 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:04,195 INFO L225 Difference]: With dead ends: 19988 [2025-04-13 18:56:04,196 INFO L226 Difference]: Without dead ends: 19924 [2025-04-13 18:56:04,204 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=440, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:56:04,204 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 295 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:04,204 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 534 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:56:04,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19924 states. [2025-04-13 18:56:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19924 to 10529. [2025-04-13 18:56:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10529 states, 10528 states have (on average 3.8399506079027357) internal successors, (40427), 10528 states have internal predecessors, (40427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10529 states to 10529 states and 40427 transitions. [2025-04-13 18:56:04,450 INFO L79 Accepts]: Start accepts. Automaton has 10529 states and 40427 transitions. Word has length 54 [2025-04-13 18:56:04,451 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:04,451 INFO L485 AbstractCegarLoop]: Abstraction has 10529 states and 40427 transitions. [2025-04-13 18:56:04,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:04,451 INFO L278 IsEmpty]: Start isEmpty. Operand 10529 states and 40427 transitions. [2025-04-13 18:56:04,467 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:04,467 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:04,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:04,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2025-04-13 18:56:04,467 INFO L403 AbstractCegarLoop]: === Iteration 179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:04,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:04,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1151152894, now seen corresponding path program 179 times [2025-04-13 18:56:04,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:04,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31132905] [2025-04-13 18:56:04,468 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:56:04,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:04,471 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:04,481 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:04,482 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:56:04,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:05,114 INFO L134 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:56:05,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:05,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31132905] [2025-04-13 18:56:05,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31132905] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:05,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:05,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:05,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280717765] [2025-04-13 18:56:05,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:05,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:05,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:05,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:05,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:05,115 INFO L87 Difference]: Start difference. First operand 10529 states and 40427 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:06,205 INFO L93 Difference]: Finished difference Result 19085 states and 70653 transitions. [2025-04-13 18:56:06,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:56:06,205 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:06,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:06,284 INFO L225 Difference]: With dead ends: 19085 [2025-04-13 18:56:06,284 INFO L226 Difference]: Without dead ends: 19007 [2025-04-13 18:56:06,289 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=440, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:56:06,290 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 276 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:06,290 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 544 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:56:06,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19007 states. [2025-04-13 18:56:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19007 to 10519. [2025-04-13 18:56:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10519 states, 10518 states have (on average 3.840273816314889) internal successors, (40392), 10518 states have internal predecessors, (40392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10519 states to 10519 states and 40392 transitions. [2025-04-13 18:56:06,556 INFO L79 Accepts]: Start accepts. Automaton has 10519 states and 40392 transitions. Word has length 54 [2025-04-13 18:56:06,557 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:06,557 INFO L485 AbstractCegarLoop]: Abstraction has 10519 states and 40392 transitions. [2025-04-13 18:56:06,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:06,557 INFO L278 IsEmpty]: Start isEmpty. Operand 10519 states and 40392 transitions. [2025-04-13 18:56:06,574 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:06,574 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:06,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:06,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2025-04-13 18:56:06,574 INFO L403 AbstractCegarLoop]: === Iteration 180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:06,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:06,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2139802262, now seen corresponding path program 180 times [2025-04-13 18:56:06,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:06,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405151862] [2025-04-13 18:56:06,575 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:56:06,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:06,578 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:06,588 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:06,589 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:56:06,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:07,185 INFO L134 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:56:07,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:07,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405151862] [2025-04-13 18:56:07,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405151862] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:07,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:07,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:07,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846301381] [2025-04-13 18:56:07,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:07,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:07,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:07,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:07,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:07,186 INFO L87 Difference]: Start difference. First operand 10519 states and 40392 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:08,145 INFO L93 Difference]: Finished difference Result 19985 states and 73640 transitions. [2025-04-13 18:56:08,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:56:08,145 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:08,145 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:08,204 INFO L225 Difference]: With dead ends: 19985 [2025-04-13 18:56:08,204 INFO L226 Difference]: Without dead ends: 19906 [2025-04-13 18:56:08,210 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:56:08,211 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 303 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:08,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 481 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:08,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19906 states. [2025-04-13 18:56:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19906 to 10511. [2025-04-13 18:56:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10511 states, 10510 states have (on average 3.840532825880114) internal successors, (40364), 10510 states have internal predecessors, (40364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10511 states to 10511 states and 40364 transitions. [2025-04-13 18:56:08,468 INFO L79 Accepts]: Start accepts. Automaton has 10511 states and 40364 transitions. Word has length 54 [2025-04-13 18:56:08,468 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:08,468 INFO L485 AbstractCegarLoop]: Abstraction has 10511 states and 40364 transitions. [2025-04-13 18:56:08,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:08,468 INFO L278 IsEmpty]: Start isEmpty. Operand 10511 states and 40364 transitions. [2025-04-13 18:56:08,527 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:08,527 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:08,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:08,527 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2025-04-13 18:56:08,527 INFO L403 AbstractCegarLoop]: === Iteration 181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:08,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:08,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1624775604, now seen corresponding path program 181 times [2025-04-13 18:56:08,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:08,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426666894] [2025-04-13 18:56:08,528 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:56:08,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:08,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:08,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:08,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:56:08,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:09,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:56:09,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:09,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426666894] [2025-04-13 18:56:09,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426666894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:09,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:09,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:09,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636589197] [2025-04-13 18:56:09,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:09,118 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:09,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:09,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:09,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:09,118 INFO L87 Difference]: Start difference. First operand 10511 states and 40364 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:10,038 INFO L93 Difference]: Finished difference Result 18999 states and 70417 transitions. [2025-04-13 18:56:10,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:56:10,038 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:10,038 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:10,105 INFO L225 Difference]: With dead ends: 18999 [2025-04-13 18:56:10,105 INFO L226 Difference]: Without dead ends: 18863 [2025-04-13 18:56:10,112 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=438, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:56:10,112 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 263 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:10,112 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 515 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:10,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18863 states. [2025-04-13 18:56:10,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18863 to 10483. [2025-04-13 18:56:10,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10483 states, 10482 states have (on average 3.8423964892196145) internal successors, (40276), 10482 states have internal predecessors, (40276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:10,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10483 states to 10483 states and 40276 transitions. [2025-04-13 18:56:10,375 INFO L79 Accepts]: Start accepts. Automaton has 10483 states and 40276 transitions. Word has length 54 [2025-04-13 18:56:10,376 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:10,376 INFO L485 AbstractCegarLoop]: Abstraction has 10483 states and 40276 transitions. [2025-04-13 18:56:10,376 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:10,376 INFO L278 IsEmpty]: Start isEmpty. Operand 10483 states and 40276 transitions. [2025-04-13 18:56:10,392 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:10,393 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:10,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:10,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2025-04-13 18:56:10,393 INFO L403 AbstractCegarLoop]: === Iteration 182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:10,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:10,393 INFO L85 PathProgramCache]: Analyzing trace with hash 295167240, now seen corresponding path program 182 times [2025-04-13 18:56:10,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:10,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282122521] [2025-04-13 18:56:10,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:56:10,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:10,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:10,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:10,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:56:10,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:56:11,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:11,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282122521] [2025-04-13 18:56:11,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282122521] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:11,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:11,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:11,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032552954] [2025-04-13 18:56:11,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:11,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:11,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:11,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:11,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:11,057 INFO L87 Difference]: Start difference. First operand 10483 states and 40276 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:12,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:12,099 INFO L93 Difference]: Finished difference Result 19878 states and 73344 transitions. [2025-04-13 18:56:12,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:56:12,100 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:12,100 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:12,173 INFO L225 Difference]: With dead ends: 19878 [2025-04-13 18:56:12,173 INFO L226 Difference]: Without dead ends: 19737 [2025-04-13 18:56:12,182 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=438, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:56:12,182 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 274 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:12,182 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 502 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:56:12,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19737 states. [2025-04-13 18:56:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19737 to 10459. [2025-04-13 18:56:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10459 states, 10458 states have (on average 3.8439472174411935) internal successors, (40200), 10458 states have internal predecessors, (40200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10459 states to 10459 states and 40200 transitions. [2025-04-13 18:56:12,472 INFO L79 Accepts]: Start accepts. Automaton has 10459 states and 40200 transitions. Word has length 54 [2025-04-13 18:56:12,472 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:12,472 INFO L485 AbstractCegarLoop]: Abstraction has 10459 states and 40200 transitions. [2025-04-13 18:56:12,472 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:12,473 INFO L278 IsEmpty]: Start isEmpty. Operand 10459 states and 40200 transitions. [2025-04-13 18:56:12,489 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:12,489 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:12,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:12,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2025-04-13 18:56:12,490 INFO L403 AbstractCegarLoop]: === Iteration 183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:12,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:12,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1015361772, now seen corresponding path program 183 times [2025-04-13 18:56:12,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:12,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976500448] [2025-04-13 18:56:12,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:56:12,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:12,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:12,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:12,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:56:12,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:13,150 INFO L134 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:56:13,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:13,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976500448] [2025-04-13 18:56:13,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976500448] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:13,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:13,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:13,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189800041] [2025-04-13 18:56:13,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:13,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:13,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:13,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:13,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:13,151 INFO L87 Difference]: Start difference. First operand 10459 states and 40200 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:14,129 INFO L93 Difference]: Finished difference Result 18753 states and 69644 transitions. [2025-04-13 18:56:14,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:56:14,129 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:14,129 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:14,196 INFO L225 Difference]: With dead ends: 18753 [2025-04-13 18:56:14,196 INFO L226 Difference]: Without dead ends: 18617 [2025-04-13 18:56:14,203 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:56:14,203 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 255 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:14,203 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 499 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18617 states. [2025-04-13 18:56:14,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18617 to 10549. [2025-04-13 18:56:14,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10549 states, 10548 states have (on average 3.838168373151308) internal successors, (40485), 10548 states have internal predecessors, (40485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10549 states to 10549 states and 40485 transitions. [2025-04-13 18:56:14,479 INFO L79 Accepts]: Start accepts. Automaton has 10549 states and 40485 transitions. Word has length 54 [2025-04-13 18:56:14,479 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:14,479 INFO L485 AbstractCegarLoop]: Abstraction has 10549 states and 40485 transitions. [2025-04-13 18:56:14,479 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:14,479 INFO L278 IsEmpty]: Start isEmpty. Operand 10549 states and 40485 transitions. [2025-04-13 18:56:14,496 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:14,496 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:14,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:14,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2025-04-13 18:56:14,496 INFO L403 AbstractCegarLoop]: === Iteration 184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:14,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:14,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1551778984, now seen corresponding path program 184 times [2025-04-13 18:56:14,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:14,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187160090] [2025-04-13 18:56:14,496 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:56:14,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:14,499 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:56:14,510 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:14,510 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:56:14,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:15,049 INFO L134 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:56:15,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:15,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187160090] [2025-04-13 18:56:15,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187160090] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:15,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:15,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:15,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914180663] [2025-04-13 18:56:15,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:15,049 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:15,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:15,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:15,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:15,050 INFO L87 Difference]: Start difference. First operand 10549 states and 40485 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:15,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:15,981 INFO L93 Difference]: Finished difference Result 19709 states and 72838 transitions. [2025-04-13 18:56:15,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:56:15,981 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:15,981 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:16,057 INFO L225 Difference]: With dead ends: 19709 [2025-04-13 18:56:16,057 INFO L226 Difference]: Without dead ends: 19597 [2025-04-13 18:56:16,065 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:56:16,066 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 276 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:16,066 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 482 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19597 states. [2025-04-13 18:56:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19597 to 10621. [2025-04-13 18:56:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10621 states, 10620 states have (on average 3.8336158192090397) internal successors, (40713), 10620 states have internal predecessors, (40713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10621 states to 10621 states and 40713 transitions. [2025-04-13 18:56:16,411 INFO L79 Accepts]: Start accepts. Automaton has 10621 states and 40713 transitions. Word has length 54 [2025-04-13 18:56:16,411 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:16,411 INFO L485 AbstractCegarLoop]: Abstraction has 10621 states and 40713 transitions. [2025-04-13 18:56:16,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:16,411 INFO L278 IsEmpty]: Start isEmpty. Operand 10621 states and 40713 transitions. [2025-04-13 18:56:16,429 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:16,429 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:16,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:56:16,429 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2025-04-13 18:56:16,429 INFO L403 AbstractCegarLoop]: === Iteration 185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:16,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:16,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1742186294, now seen corresponding path program 185 times [2025-04-13 18:56:16,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:16,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062288188] [2025-04-13 18:56:16,430 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:56:16,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:16,433 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:16,445 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:16,445 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:56:16,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:17,079 INFO L134 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:56:17,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:17,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062288188] [2025-04-13 18:56:17,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062288188] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:17,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:17,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:17,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865579908] [2025-04-13 18:56:17,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:17,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:17,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:17,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:17,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:17,080 INFO L87 Difference]: Start difference. First operand 10621 states and 40713 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:18,029 INFO L93 Difference]: Finished difference Result 18837 states and 69855 transitions. [2025-04-13 18:56:18,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:56:18,029 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:18,029 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:18,090 INFO L225 Difference]: With dead ends: 18837 [2025-04-13 18:56:18,090 INFO L226 Difference]: Without dead ends: 18767 [2025-04-13 18:56:18,095 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:56:18,095 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 258 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:18,096 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 526 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:18,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18767 states. [2025-04-13 18:56:18,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18767 to 10631. [2025-04-13 18:56:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10631 states, 10630 states have (on average 3.8323612417685795) internal successors, (40738), 10630 states have internal predecessors, (40738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10631 states to 10631 states and 40738 transitions. [2025-04-13 18:56:18,449 INFO L79 Accepts]: Start accepts. Automaton has 10631 states and 40738 transitions. Word has length 54 [2025-04-13 18:56:18,449 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:18,449 INFO L485 AbstractCegarLoop]: Abstraction has 10631 states and 40738 transitions. [2025-04-13 18:56:18,449 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:18,449 INFO L278 IsEmpty]: Start isEmpty. Operand 10631 states and 40738 transitions. [2025-04-13 18:56:18,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:18,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:18,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:18,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2025-04-13 18:56:18,469 INFO L403 AbstractCegarLoop]: === Iteration 186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:18,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash -321739574, now seen corresponding path program 186 times [2025-04-13 18:56:18,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:18,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327607898] [2025-04-13 18:56:18,470 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:56:18,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:18,473 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:18,483 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:18,483 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:56:18,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:19,066 INFO L134 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:56:19,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:19,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327607898] [2025-04-13 18:56:19,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327607898] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:19,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:19,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:19,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894562890] [2025-04-13 18:56:19,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:19,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:19,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:19,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:19,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:19,067 INFO L87 Difference]: Start difference. First operand 10631 states and 40738 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:20,029 INFO L93 Difference]: Finished difference Result 19750 states and 72903 transitions. [2025-04-13 18:56:20,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:56:20,029 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:20,029 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:20,094 INFO L225 Difference]: With dead ends: 19750 [2025-04-13 18:56:20,094 INFO L226 Difference]: Without dead ends: 19686 [2025-04-13 18:56:20,101 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:56:20,101 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 289 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:20,101 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 498 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:20,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19686 states. [2025-04-13 18:56:20,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19686 to 10639. [2025-04-13 18:56:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10639 states, 10638 states have (on average 3.831359278059786) internal successors, (40758), 10638 states have internal predecessors, (40758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10639 states to 10639 states and 40758 transitions. [2025-04-13 18:56:20,369 INFO L79 Accepts]: Start accepts. Automaton has 10639 states and 40758 transitions. Word has length 54 [2025-04-13 18:56:20,369 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:20,369 INFO L485 AbstractCegarLoop]: Abstraction has 10639 states and 40758 transitions. [2025-04-13 18:56:20,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:20,369 INFO L278 IsEmpty]: Start isEmpty. Operand 10639 states and 40758 transitions. [2025-04-13 18:56:20,386 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:20,387 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:20,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:20,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2025-04-13 18:56:20,387 INFO L403 AbstractCegarLoop]: === Iteration 187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:20,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:20,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1632205036, now seen corresponding path program 187 times [2025-04-13 18:56:20,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:20,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983416241] [2025-04-13 18:56:20,387 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:56:20,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:20,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:20,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:20,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:56:20,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:21,045 INFO L134 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:56:21,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:21,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983416241] [2025-04-13 18:56:21,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983416241] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:21,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:21,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:21,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540138527] [2025-04-13 18:56:21,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:21,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:21,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:21,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:21,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:21,046 INFO L87 Difference]: Start difference. First operand 10639 states and 40758 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:21,906 INFO L93 Difference]: Finished difference Result 18775 states and 69687 transitions. [2025-04-13 18:56:21,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:56:21,906 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:21,906 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:21,966 INFO L225 Difference]: With dead ends: 18775 [2025-04-13 18:56:21,966 INFO L226 Difference]: Without dead ends: 18667 [2025-04-13 18:56:21,972 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:56:21,973 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 268 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:21,973 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 494 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18667 states. [2025-04-13 18:56:22,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18667 to 10599. [2025-04-13 18:56:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10599 states, 10598 states have (on average 3.833553500660502) internal successors, (40628), 10598 states have internal predecessors, (40628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10599 states to 10599 states and 40628 transitions. [2025-04-13 18:56:22,209 INFO L79 Accepts]: Start accepts. Automaton has 10599 states and 40628 transitions. Word has length 54 [2025-04-13 18:56:22,209 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:22,209 INFO L485 AbstractCegarLoop]: Abstraction has 10599 states and 40628 transitions. [2025-04-13 18:56:22,209 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:22,209 INFO L278 IsEmpty]: Start isEmpty. Operand 10599 states and 40628 transitions. [2025-04-13 18:56:22,225 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:22,225 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:22,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:22,225 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2025-04-13 18:56:22,225 INFO L403 AbstractCegarLoop]: === Iteration 188 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:22,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:22,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1767310168, now seen corresponding path program 188 times [2025-04-13 18:56:22,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:22,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220208649] [2025-04-13 18:56:22,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:56:22,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:22,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:22,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:22,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:56:22,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:22,853 INFO L134 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:56:22,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:22,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220208649] [2025-04-13 18:56:22,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220208649] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:22,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:22,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:22,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543382935] [2025-04-13 18:56:22,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:22,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:22,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:22,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:22,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:22,854 INFO L87 Difference]: Start difference. First operand 10599 states and 40628 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:23,761 INFO L93 Difference]: Finished difference Result 19646 states and 72604 transitions. [2025-04-13 18:56:23,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:56:23,761 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:23,762 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:23,824 INFO L225 Difference]: With dead ends: 19646 [2025-04-13 18:56:23,824 INFO L226 Difference]: Without dead ends: 19543 [2025-04-13 18:56:23,830 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:56:23,830 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 270 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:23,830 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 476 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19543 states. [2025-04-13 18:56:24,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19543 to 10567. [2025-04-13 18:56:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10567 states, 10566 states have (on average 3.835320840431573) internal successors, (40524), 10566 states have internal predecessors, (40524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10567 states to 10567 states and 40524 transitions. [2025-04-13 18:56:24,090 INFO L79 Accepts]: Start accepts. Automaton has 10567 states and 40524 transitions. Word has length 54 [2025-04-13 18:56:24,090 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:24,090 INFO L485 AbstractCegarLoop]: Abstraction has 10567 states and 40524 transitions. [2025-04-13 18:56:24,090 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:24,090 INFO L278 IsEmpty]: Start isEmpty. Operand 10567 states and 40524 transitions. [2025-04-13 18:56:24,107 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:24,107 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:24,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:24,107 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2025-04-13 18:56:24,107 INFO L403 AbstractCegarLoop]: === Iteration 189 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:24,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:24,107 INFO L85 PathProgramCache]: Analyzing trace with hash -29410266, now seen corresponding path program 189 times [2025-04-13 18:56:24,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:24,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146121118] [2025-04-13 18:56:24,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:56:24,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:24,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:24,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:24,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:56:24,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:24,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:56:24,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:24,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146121118] [2025-04-13 18:56:24,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146121118] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:24,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:24,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:24,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313808983] [2025-04-13 18:56:24,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:24,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:24,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:24,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:24,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:24,757 INFO L87 Difference]: Start difference. First operand 10567 states and 40524 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:25,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:25,740 INFO L93 Difference]: Finished difference Result 18743 states and 69583 transitions. [2025-04-13 18:56:25,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:56:25,740 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:25,740 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:25,801 INFO L225 Difference]: With dead ends: 18743 [2025-04-13 18:56:25,801 INFO L226 Difference]: Without dead ends: 18673 [2025-04-13 18:56:25,808 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:56:25,808 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 247 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:25,808 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 536 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18673 states. [2025-04-13 18:56:25,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18673 to 10597. [2025-04-13 18:56:26,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10597 states, 10596 states have (on average 3.8334277085692716) internal successors, (40619), 10596 states have internal predecessors, (40619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10597 states to 10597 states and 40619 transitions. [2025-04-13 18:56:26,049 INFO L79 Accepts]: Start accepts. Automaton has 10597 states and 40619 transitions. Word has length 54 [2025-04-13 18:56:26,049 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:26,049 INFO L485 AbstractCegarLoop]: Abstraction has 10597 states and 40619 transitions. [2025-04-13 18:56:26,049 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:26,050 INFO L278 IsEmpty]: Start isEmpty. Operand 10597 states and 40619 transitions. [2025-04-13 18:56:26,066 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:26,066 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:26,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:56:26,066 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2025-04-13 18:56:26,066 INFO L403 AbstractCegarLoop]: === Iteration 190 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:26,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:26,066 INFO L85 PathProgramCache]: Analyzing trace with hash 698082810, now seen corresponding path program 190 times [2025-04-13 18:56:26,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:26,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92022902] [2025-04-13 18:56:26,067 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:56:26,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:26,069 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:56:26,080 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:26,080 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:56:26,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:26,634 INFO L134 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:56:26,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:26,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92022902] [2025-04-13 18:56:26,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92022902] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:26,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:26,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:26,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529985890] [2025-04-13 18:56:26,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:26,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:26,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:26,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:26,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:26,635 INFO L87 Difference]: Start difference. First operand 10597 states and 40619 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:27,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:27,483 INFO L93 Difference]: Finished difference Result 19683 states and 72718 transitions. [2025-04-13 18:56:27,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:56:27,483 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:27,483 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:27,550 INFO L225 Difference]: With dead ends: 19683 [2025-04-13 18:56:27,550 INFO L226 Difference]: Without dead ends: 19619 [2025-04-13 18:56:27,557 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:56:27,557 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 281 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:27,557 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 468 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19619 states. [2025-04-13 18:56:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19619 to 10621. [2025-04-13 18:56:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10621 states, 10620 states have (on average 3.8319209039548023) internal successors, (40695), 10620 states have internal predecessors, (40695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10621 states to 10621 states and 40695 transitions. [2025-04-13 18:56:27,867 INFO L79 Accepts]: Start accepts. Automaton has 10621 states and 40695 transitions. Word has length 54 [2025-04-13 18:56:27,867 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:27,867 INFO L485 AbstractCegarLoop]: Abstraction has 10621 states and 40695 transitions. [2025-04-13 18:56:27,867 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:27,867 INFO L278 IsEmpty]: Start isEmpty. Operand 10621 states and 40695 transitions. [2025-04-13 18:56:27,883 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:27,883 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:27,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:27,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2025-04-13 18:56:27,883 INFO L403 AbstractCegarLoop]: === Iteration 191 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:27,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:27,884 INFO L85 PathProgramCache]: Analyzing trace with hash 891165700, now seen corresponding path program 191 times [2025-04-13 18:56:27,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:27,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547166943] [2025-04-13 18:56:27,884 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:56:27,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:27,886 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:27,898 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:27,898 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:56:27,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:56:28,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:28,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547166943] [2025-04-13 18:56:28,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547166943] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:28,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:28,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:28,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530885960] [2025-04-13 18:56:28,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:28,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:28,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:28,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:28,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:28,505 INFO L87 Difference]: Start difference. First operand 10621 states and 40695 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:29,419 INFO L93 Difference]: Finished difference Result 18765 states and 69644 transitions. [2025-04-13 18:56:29,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:56:29,420 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:29,420 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:29,482 INFO L225 Difference]: With dead ends: 18765 [2025-04-13 18:56:29,482 INFO L226 Difference]: Without dead ends: 18687 [2025-04-13 18:56:29,488 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:56:29,488 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 269 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:29,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 529 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18687 states. [2025-04-13 18:56:29,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18687 to 10611. [2025-04-13 18:56:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10611 states, 10610 states have (on average 3.832233741753063) internal successors, (40660), 10610 states have internal predecessors, (40660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10611 states to 10611 states and 40660 transitions. [2025-04-13 18:56:29,731 INFO L79 Accepts]: Start accepts. Automaton has 10611 states and 40660 transitions. Word has length 54 [2025-04-13 18:56:29,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:29,731 INFO L485 AbstractCegarLoop]: Abstraction has 10611 states and 40660 transitions. [2025-04-13 18:56:29,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:29,731 INFO L278 IsEmpty]: Start isEmpty. Operand 10611 states and 40660 transitions. [2025-04-13 18:56:29,748 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:29,748 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:29,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:29,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2025-04-13 18:56:29,748 INFO L403 AbstractCegarLoop]: === Iteration 192 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:29,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:29,748 INFO L85 PathProgramCache]: Analyzing trace with hash -747487784, now seen corresponding path program 192 times [2025-04-13 18:56:29,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:29,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491586653] [2025-04-13 18:56:29,748 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:56:29,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:29,751 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:29,795 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:29,795 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:56:29,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:30,424 INFO L134 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:56:30,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:30,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491586653] [2025-04-13 18:56:30,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491586653] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:30,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:30,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:30,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800661311] [2025-04-13 18:56:30,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:30,426 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:30,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:30,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:30,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:30,426 INFO L87 Difference]: Start difference. First operand 10611 states and 40660 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:31,289 INFO L93 Difference]: Finished difference Result 19680 states and 72694 transitions. [2025-04-13 18:56:31,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:56:31,289 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:31,289 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:31,353 INFO L225 Difference]: With dead ends: 19680 [2025-04-13 18:56:31,353 INFO L226 Difference]: Without dead ends: 19601 [2025-04-13 18:56:31,360 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:56:31,360 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 321 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:31,360 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 424 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19601 states. [2025-04-13 18:56:31,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19601 to 10603. [2025-04-13 18:56:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10603 states, 10602 states have (on average 3.8324844368986986) internal successors, (40632), 10602 states have internal predecessors, (40632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10603 states to 10603 states and 40632 transitions. [2025-04-13 18:56:31,613 INFO L79 Accepts]: Start accepts. Automaton has 10603 states and 40632 transitions. Word has length 54 [2025-04-13 18:56:31,613 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:31,613 INFO L485 AbstractCegarLoop]: Abstraction has 10603 states and 40632 transitions. [2025-04-13 18:56:31,613 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:31,613 INFO L278 IsEmpty]: Start isEmpty. Operand 10603 states and 40632 transitions. [2025-04-13 18:56:31,630 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:31,630 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:31,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:56:31,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2025-04-13 18:56:31,630 INFO L403 AbstractCegarLoop]: === Iteration 193 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:31,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:31,630 INFO L85 PathProgramCache]: Analyzing trace with hash -627873098, now seen corresponding path program 193 times [2025-04-13 18:56:31,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:31,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074853948] [2025-04-13 18:56:31,630 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:56:31,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:31,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:31,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:31,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:56:31,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:32,247 INFO L134 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:56:32,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:32,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074853948] [2025-04-13 18:56:32,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074853948] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:32,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:32,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:32,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178142401] [2025-04-13 18:56:32,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:32,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:32,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:32,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:32,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:32,248 INFO L87 Difference]: Start difference. First operand 10603 states and 40632 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:33,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:33,173 INFO L93 Difference]: Finished difference Result 18679 states and 69408 transitions. [2025-04-13 18:56:33,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:56:33,174 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:33,174 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:33,235 INFO L225 Difference]: With dead ends: 18679 [2025-04-13 18:56:33,235 INFO L226 Difference]: Without dead ends: 18467 [2025-04-13 18:56:33,242 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:56:33,242 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 254 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:33,242 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 503 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:33,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18467 states. [2025-04-13 18:56:33,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18467 to 10499. [2025-04-13 18:56:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10499 states, 10498 states have (on average 3.838064393217756) internal successors, (40292), 10498 states have internal predecessors, (40292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10499 states to 10499 states and 40292 transitions. [2025-04-13 18:56:33,488 INFO L79 Accepts]: Start accepts. Automaton has 10499 states and 40292 transitions. Word has length 54 [2025-04-13 18:56:33,488 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:33,488 INFO L485 AbstractCegarLoop]: Abstraction has 10499 states and 40292 transitions. [2025-04-13 18:56:33,488 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:33,488 INFO L278 IsEmpty]: Start isEmpty. Operand 10499 states and 40292 transitions. [2025-04-13 18:56:33,504 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:33,505 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:33,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:33,505 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2025-04-13 18:56:33,505 INFO L403 AbstractCegarLoop]: === Iteration 194 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:33,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:33,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1702844490, now seen corresponding path program 194 times [2025-04-13 18:56:33,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:33,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401062663] [2025-04-13 18:56:33,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:56:33,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:33,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:33,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:33,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:56:33,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:34,138 INFO L134 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:56:34,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:34,138 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401062663] [2025-04-13 18:56:34,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401062663] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:34,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:34,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:34,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655149919] [2025-04-13 18:56:34,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:34,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:34,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:34,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:34,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:34,139 INFO L87 Difference]: Start difference. First operand 10499 states and 40292 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:35,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:35,064 INFO L93 Difference]: Finished difference Result 19497 states and 72146 transitions. [2025-04-13 18:56:35,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:56:35,065 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:35,065 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:35,129 INFO L225 Difference]: With dead ends: 19497 [2025-04-13 18:56:35,129 INFO L226 Difference]: Without dead ends: 19292 [2025-04-13 18:56:35,136 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=401, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:56:35,136 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 262 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:35,137 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 481 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19292 states. [2025-04-13 18:56:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19292 to 10411. [2025-04-13 18:56:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10411 states, 10410 states have (on average 3.8424591738712777) internal successors, (40000), 10410 states have internal predecessors, (40000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10411 states to 10411 states and 40000 transitions. [2025-04-13 18:56:35,413 INFO L79 Accepts]: Start accepts. Automaton has 10411 states and 40000 transitions. Word has length 54 [2025-04-13 18:56:35,413 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:35,413 INFO L485 AbstractCegarLoop]: Abstraction has 10411 states and 40000 transitions. [2025-04-13 18:56:35,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:35,413 INFO L278 IsEmpty]: Start isEmpty. Operand 10411 states and 40000 transitions. [2025-04-13 18:56:35,430 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:35,430 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:35,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:56:35,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2025-04-13 18:56:35,430 INFO L403 AbstractCegarLoop]: === Iteration 195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:35,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:35,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1898568570, now seen corresponding path program 195 times [2025-04-13 18:56:35,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:35,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336723831] [2025-04-13 18:56:35,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:56:35,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:35,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:35,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:35,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:56:35,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:36,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:56:36,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:36,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336723831] [2025-04-13 18:56:36,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336723831] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:36,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:36,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:36,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404790199] [2025-04-13 18:56:36,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:36,040 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:36,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:36,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:36,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:36,041 INFO L87 Difference]: Start difference. First operand 10411 states and 40000 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:37,057 INFO L93 Difference]: Finished difference Result 18757 states and 69552 transitions. [2025-04-13 18:56:37,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:56:37,057 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:37,057 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:37,118 INFO L225 Difference]: With dead ends: 18757 [2025-04-13 18:56:37,118 INFO L226 Difference]: Without dead ends: 18693 [2025-04-13 18:56:37,122 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:56:37,122 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 299 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:37,122 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 592 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:56:37,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18693 states. [2025-04-13 18:56:37,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18693 to 10487. [2025-04-13 18:56:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10487 states, 10486 states have (on average 3.840930764829296) internal successors, (40276), 10486 states have internal predecessors, (40276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10487 states to 10487 states and 40276 transitions. [2025-04-13 18:56:37,357 INFO L79 Accepts]: Start accepts. Automaton has 10487 states and 40276 transitions. Word has length 54 [2025-04-13 18:56:37,357 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:37,357 INFO L485 AbstractCegarLoop]: Abstraction has 10487 states and 40276 transitions. [2025-04-13 18:56:37,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:37,357 INFO L278 IsEmpty]: Start isEmpty. Operand 10487 states and 40276 transitions. [2025-04-13 18:56:37,373 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:37,373 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:37,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:37,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2025-04-13 18:56:37,373 INFO L403 AbstractCegarLoop]: === Iteration 196 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:37,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:37,374 INFO L85 PathProgramCache]: Analyzing trace with hash -398065126, now seen corresponding path program 196 times [2025-04-13 18:56:37,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:37,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542197463] [2025-04-13 18:56:37,374 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:56:37,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:37,376 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:56:37,388 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:37,388 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:56:37,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:37,983 INFO L134 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:56:37,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:37,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542197463] [2025-04-13 18:56:37,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542197463] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:37,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:37,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:37,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330055375] [2025-04-13 18:56:37,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:37,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:37,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:37,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:37,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:37,984 INFO L87 Difference]: Start difference. First operand 10487 states and 40276 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:39,097 INFO L93 Difference]: Finished difference Result 19789 states and 73022 transitions. [2025-04-13 18:56:39,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:56:39,097 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:39,097 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:39,160 INFO L225 Difference]: With dead ends: 19789 [2025-04-13 18:56:39,161 INFO L226 Difference]: Without dead ends: 19719 [2025-04-13 18:56:39,167 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:56:39,167 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 313 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:39,167 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 559 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:56:39,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19719 states. [2025-04-13 18:56:39,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19719 to 10563. [2025-04-13 18:56:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10563 states, 10562 states have (on average 3.839424351448589) internal successors, (40552), 10562 states have internal predecessors, (40552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10563 states to 10563 states and 40552 transitions. [2025-04-13 18:56:39,501 INFO L79 Accepts]: Start accepts. Automaton has 10563 states and 40552 transitions. Word has length 54 [2025-04-13 18:56:39,501 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:39,501 INFO L485 AbstractCegarLoop]: Abstraction has 10563 states and 40552 transitions. [2025-04-13 18:56:39,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:39,501 INFO L278 IsEmpty]: Start isEmpty. Operand 10563 states and 40552 transitions. [2025-04-13 18:56:39,517 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:39,517 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:39,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:39,517 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2025-04-13 18:56:39,517 INFO L403 AbstractCegarLoop]: === Iteration 197 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:39,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash -928906650, now seen corresponding path program 197 times [2025-04-13 18:56:39,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:39,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665369573] [2025-04-13 18:56:39,518 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:56:39,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:39,520 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:39,531 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:39,531 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:56:39,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:40,089 INFO L134 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:56:40,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:40,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665369573] [2025-04-13 18:56:40,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665369573] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:40,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:40,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:40,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476344316] [2025-04-13 18:56:40,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:40,090 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:40,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:40,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:40,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:40,090 INFO L87 Difference]: Start difference. First operand 10563 states and 40552 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:41,008 INFO L93 Difference]: Finished difference Result 18769 states and 69659 transitions. [2025-04-13 18:56:41,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:56:41,009 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:41,009 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:41,071 INFO L225 Difference]: With dead ends: 18769 [2025-04-13 18:56:41,071 INFO L226 Difference]: Without dead ends: 18691 [2025-04-13 18:56:41,077 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:56:41,078 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 300 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:41,078 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 563 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18691 states. [2025-04-13 18:56:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18691 to 10555. [2025-04-13 18:56:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10555 states, 10554 states have (on average 3.839681637293917) internal successors, (40524), 10554 states have internal predecessors, (40524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10555 states to 10555 states and 40524 transitions. [2025-04-13 18:56:41,314 INFO L79 Accepts]: Start accepts. Automaton has 10555 states and 40524 transitions. Word has length 54 [2025-04-13 18:56:41,314 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:41,314 INFO L485 AbstractCegarLoop]: Abstraction has 10555 states and 40524 transitions. [2025-04-13 18:56:41,314 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:41,314 INFO L278 IsEmpty]: Start isEmpty. Operand 10555 states and 40524 transitions. [2025-04-13 18:56:41,330 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:41,330 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:41,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:41,330 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2025-04-13 18:56:41,330 INFO L403 AbstractCegarLoop]: === Iteration 198 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:41,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1367727046, now seen corresponding path program 198 times [2025-04-13 18:56:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:41,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231319027] [2025-04-13 18:56:41,330 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:56:41,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:41,333 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:41,342 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:41,342 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:56:41,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:41,975 INFO L134 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:56:41,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:41,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231319027] [2025-04-13 18:56:41,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231319027] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:41,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:41,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:41,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826818998] [2025-04-13 18:56:41,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:41,976 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:41,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:41,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:41,976 INFO L87 Difference]: Start difference. First operand 10555 states and 40524 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:42,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:42,899 INFO L93 Difference]: Finished difference Result 19711 states and 72808 transitions. [2025-04-13 18:56:42,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:56:42,899 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:42,899 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:42,962 INFO L225 Difference]: With dead ends: 19711 [2025-04-13 18:56:42,962 INFO L226 Difference]: Without dead ends: 19639 [2025-04-13 18:56:42,968 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:56:42,969 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 290 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:42,969 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 557 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19639 states. [2025-04-13 18:56:43,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19639 to 10547. [2025-04-13 18:56:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10547 states, 10546 states have (on average 3.8399393134837854) internal successors, (40496), 10546 states have internal predecessors, (40496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10547 states to 10547 states and 40496 transitions. [2025-04-13 18:56:43,223 INFO L79 Accepts]: Start accepts. Automaton has 10547 states and 40496 transitions. Word has length 54 [2025-04-13 18:56:43,223 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:43,223 INFO L485 AbstractCegarLoop]: Abstraction has 10547 states and 40496 transitions. [2025-04-13 18:56:43,223 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:43,223 INFO L278 IsEmpty]: Start isEmpty. Operand 10547 states and 40496 transitions. [2025-04-13 18:56:43,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:43,239 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:43,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:43,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2025-04-13 18:56:43,240 INFO L403 AbstractCegarLoop]: === Iteration 199 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:43,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:43,240 INFO L85 PathProgramCache]: Analyzing trace with hash -282376060, now seen corresponding path program 199 times [2025-04-13 18:56:43,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:43,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630952422] [2025-04-13 18:56:43,240 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:56:43,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:43,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:43,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:43,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:56:43,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:43,907 INFO L134 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:56:43,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:43,907 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630952422] [2025-04-13 18:56:43,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630952422] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:43,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:43,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:43,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906814118] [2025-04-13 18:56:43,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:43,907 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:43,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:43,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:43,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:43,907 INFO L87 Difference]: Start difference. First operand 10547 states and 40496 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:44,863 INFO L93 Difference]: Finished difference Result 18795 states and 69730 transitions. [2025-04-13 18:56:44,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:56:44,863 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:44,863 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:44,924 INFO L225 Difference]: With dead ends: 18795 [2025-04-13 18:56:44,924 INFO L226 Difference]: Without dead ends: 18659 [2025-04-13 18:56:44,930 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:56:44,930 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 302 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:44,930 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 548 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:44,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18659 states. [2025-04-13 18:56:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18659 to 10523. [2025-04-13 18:56:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10523 states, 10522 states have (on average 3.8403345371602358) internal successors, (40408), 10522 states have internal predecessors, (40408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10523 states to 10523 states and 40408 transitions. [2025-04-13 18:56:45,166 INFO L79 Accepts]: Start accepts. Automaton has 10523 states and 40408 transitions. Word has length 54 [2025-04-13 18:56:45,166 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:45,166 INFO L485 AbstractCegarLoop]: Abstraction has 10523 states and 40408 transitions. [2025-04-13 18:56:45,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:45,166 INFO L278 IsEmpty]: Start isEmpty. Operand 10523 states and 40408 transitions. [2025-04-13 18:56:45,182 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:45,182 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:45,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:45,182 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2025-04-13 18:56:45,182 INFO L403 AbstractCegarLoop]: === Iteration 200 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:45,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:45,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1207624280, now seen corresponding path program 200 times [2025-04-13 18:56:45,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:45,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801128695] [2025-04-13 18:56:45,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:56:45,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:45,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:45,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:45,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:56:45,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:45,833 INFO L134 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:56:45,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:45,833 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801128695] [2025-04-13 18:56:45,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801128695] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:45,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:45,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:45,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593475482] [2025-04-13 18:56:45,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:45,834 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:45,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:45,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:45,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:45,834 INFO L87 Difference]: Start difference. First operand 10523 states and 40408 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:46,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:46,730 INFO L93 Difference]: Finished difference Result 19751 states and 72904 transitions. [2025-04-13 18:56:46,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:56:46,730 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:46,730 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:46,793 INFO L225 Difference]: With dead ends: 19751 [2025-04-13 18:56:46,793 INFO L226 Difference]: Without dead ends: 19591 [2025-04-13 18:56:46,799 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:56:46,799 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 338 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:46,799 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 497 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:46,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19591 states. [2025-04-13 18:56:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19591 to 10499. [2025-04-13 18:56:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10499 states, 10498 states have (on average 3.8407315679176985) internal successors, (40320), 10498 states have internal predecessors, (40320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10499 states to 10499 states and 40320 transitions. [2025-04-13 18:56:47,031 INFO L79 Accepts]: Start accepts. Automaton has 10499 states and 40320 transitions. Word has length 54 [2025-04-13 18:56:47,031 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:47,031 INFO L485 AbstractCegarLoop]: Abstraction has 10499 states and 40320 transitions. [2025-04-13 18:56:47,031 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:47,031 INFO L278 IsEmpty]: Start isEmpty. Operand 10499 states and 40320 transitions. [2025-04-13 18:56:47,047 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:47,048 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:47,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:47,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2025-04-13 18:56:47,048 INFO L403 AbstractCegarLoop]: === Iteration 201 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:47,048 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:47,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1066470564, now seen corresponding path program 201 times [2025-04-13 18:56:47,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:47,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467053022] [2025-04-13 18:56:47,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:56:47,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:47,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:47,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:47,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:56:47,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:47,677 INFO L134 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:56:47,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:47,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467053022] [2025-04-13 18:56:47,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467053022] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:47,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:47,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:47,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855017562] [2025-04-13 18:56:47,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:47,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:47,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:47,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:47,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:47,678 INFO L87 Difference]: Start difference. First operand 10499 states and 40320 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:48,570 INFO L93 Difference]: Finished difference Result 18883 states and 69916 transitions. [2025-04-13 18:56:48,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:56:48,571 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:48,571 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:48,695 INFO L225 Difference]: With dead ends: 18883 [2025-04-13 18:56:48,695 INFO L226 Difference]: Without dead ends: 18819 [2025-04-13 18:56:48,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:56:48,698 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 360 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:48,698 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 522 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18819 states. [2025-04-13 18:56:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18819 to 10511. [2025-04-13 18:56:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10511 states, 10510 states have (on average 3.8397716460513798) internal successors, (40356), 10510 states have internal predecessors, (40356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10511 states to 10511 states and 40356 transitions. [2025-04-13 18:56:48,906 INFO L79 Accepts]: Start accepts. Automaton has 10511 states and 40356 transitions. Word has length 54 [2025-04-13 18:56:48,906 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:48,906 INFO L485 AbstractCegarLoop]: Abstraction has 10511 states and 40356 transitions. [2025-04-13 18:56:48,906 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:48,906 INFO L278 IsEmpty]: Start isEmpty. Operand 10511 states and 40356 transitions. [2025-04-13 18:56:48,921 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:48,922 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:48,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:48,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2025-04-13 18:56:48,922 INFO L403 AbstractCegarLoop]: === Iteration 202 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:48,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:48,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1727993288, now seen corresponding path program 202 times [2025-04-13 18:56:48,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:48,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173386372] [2025-04-13 18:56:48,923 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:56:48,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:48,925 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:56:48,938 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:48,938 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:56:48,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:56:49,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:49,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173386372] [2025-04-13 18:56:49,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173386372] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:49,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:49,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:49,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946245822] [2025-04-13 18:56:49,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:49,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:49,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:49,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:49,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:49,505 INFO L87 Difference]: Start difference. First operand 10511 states and 40356 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:50,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:50,475 INFO L93 Difference]: Finished difference Result 19861 states and 73173 transitions. [2025-04-13 18:56:50,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:56:50,475 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:50,475 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:50,553 INFO L225 Difference]: With dead ends: 19861 [2025-04-13 18:56:50,553 INFO L226 Difference]: Without dead ends: 19791 [2025-04-13 18:56:50,561 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:56:50,561 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 303 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:50,561 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 582 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:56:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19791 states. [2025-04-13 18:56:50,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19791 to 10523. [2025-04-13 18:56:50,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10523 states, 10522 states have (on average 3.838813913704619) internal successors, (40392), 10522 states have internal predecessors, (40392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10523 states to 10523 states and 40392 transitions. [2025-04-13 18:56:50,815 INFO L79 Accepts]: Start accepts. Automaton has 10523 states and 40392 transitions. Word has length 54 [2025-04-13 18:56:50,816 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:50,816 INFO L485 AbstractCegarLoop]: Abstraction has 10523 states and 40392 transitions. [2025-04-13 18:56:50,816 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:50,816 INFO L278 IsEmpty]: Start isEmpty. Operand 10523 states and 40392 transitions. [2025-04-13 18:56:50,832 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:50,832 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:50,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:50,832 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2025-04-13 18:56:50,832 INFO L403 AbstractCegarLoop]: === Iteration 203 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:50,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:50,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2036132484, now seen corresponding path program 203 times [2025-04-13 18:56:50,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:50,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056137820] [2025-04-13 18:56:50,832 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:56:50,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:50,835 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:50,883 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:50,883 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:56:50,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:51,458 INFO L134 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:56:51,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:51,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056137820] [2025-04-13 18:56:51,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056137820] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:51,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:51,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:51,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292619451] [2025-04-13 18:56:51,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:51,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:51,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:51,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:51,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:51,459 INFO L87 Difference]: Start difference. First operand 10523 states and 40392 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:52,361 INFO L93 Difference]: Finished difference Result 18901 states and 69961 transitions. [2025-04-13 18:56:52,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:56:52,362 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:52,362 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:52,422 INFO L225 Difference]: With dead ends: 18901 [2025-04-13 18:56:52,422 INFO L226 Difference]: Without dead ends: 18823 [2025-04-13 18:56:52,428 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:56:52,428 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 321 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:52,428 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 569 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18823 states. [2025-04-13 18:56:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18823 to 10515. [2025-04-13 18:56:52,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10515 states, 10514 states have (on average 3.8394521590260604) internal successors, (40368), 10514 states have internal predecessors, (40368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10515 states to 10515 states and 40368 transitions. [2025-04-13 18:56:52,675 INFO L79 Accepts]: Start accepts. Automaton has 10515 states and 40368 transitions. Word has length 54 [2025-04-13 18:56:52,676 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:52,676 INFO L485 AbstractCegarLoop]: Abstraction has 10515 states and 40368 transitions. [2025-04-13 18:56:52,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:52,676 INFO L278 IsEmpty]: Start isEmpty. Operand 10515 states and 40368 transitions. [2025-04-13 18:56:52,691 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:52,692 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:52,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:52,692 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2025-04-13 18:56:52,692 INFO L403 AbstractCegarLoop]: === Iteration 204 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:52,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:52,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1597312088, now seen corresponding path program 204 times [2025-04-13 18:56:52,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:52,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187180256] [2025-04-13 18:56:52,692 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:56:52,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:52,695 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:52,704 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:52,704 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:56:52,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:53,336 INFO L134 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:56:53,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:53,336 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187180256] [2025-04-13 18:56:53,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187180256] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:53,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:53,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:53,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593077301] [2025-04-13 18:56:53,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:53,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:53,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:53,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:53,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:53,337 INFO L87 Difference]: Start difference. First operand 10515 states and 40368 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:54,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:54,214 INFO L93 Difference]: Finished difference Result 19847 states and 73124 transitions. [2025-04-13 18:56:54,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:56:54,214 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:54,214 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:54,275 INFO L225 Difference]: With dead ends: 19847 [2025-04-13 18:56:54,275 INFO L226 Difference]: Without dead ends: 19775 [2025-04-13 18:56:54,281 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:56:54,282 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 342 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:54,282 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 522 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:54,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19775 states. [2025-04-13 18:56:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19775 to 10507. [2025-04-13 18:56:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10507 states, 10506 states have (on average 3.840091376356368) internal successors, (40344), 10506 states have internal predecessors, (40344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10507 states to 10507 states and 40344 transitions. [2025-04-13 18:56:54,525 INFO L79 Accepts]: Start accepts. Automaton has 10507 states and 40344 transitions. Word has length 54 [2025-04-13 18:56:54,525 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:54,525 INFO L485 AbstractCegarLoop]: Abstraction has 10507 states and 40344 transitions. [2025-04-13 18:56:54,525 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:54,525 INFO L278 IsEmpty]: Start isEmpty. Operand 10507 states and 40344 transitions. [2025-04-13 18:56:54,541 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:54,541 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:54,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:54,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2025-04-13 18:56:54,541 INFO L403 AbstractCegarLoop]: === Iteration 205 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:54,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:54,542 INFO L85 PathProgramCache]: Analyzing trace with hash -460445562, now seen corresponding path program 205 times [2025-04-13 18:56:54,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:54,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882158635] [2025-04-13 18:56:54,542 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:56:54,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:54,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:54,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:54,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:56:54,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:55,200 INFO L134 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:56:55,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:55,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882158635] [2025-04-13 18:56:55,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882158635] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:55,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:55,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:55,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070795821] [2025-04-13 18:56:55,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:55,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:55,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:55,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:55,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:55,201 INFO L87 Difference]: Start difference. First operand 10507 states and 40344 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:56,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:56,108 INFO L93 Difference]: Finished difference Result 18891 states and 69936 transitions. [2025-04-13 18:56:56,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:56:56,109 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:56,109 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:56,168 INFO L225 Difference]: With dead ends: 18891 [2025-04-13 18:56:56,168 INFO L226 Difference]: Without dead ends: 18827 [2025-04-13 18:56:56,174 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:56:56,174 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 297 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:56,174 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 551 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18827 states. [2025-04-13 18:56:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18827 to 10515. [2025-04-13 18:56:56,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10515 states, 10514 states have (on average 3.8390717139052692) internal successors, (40364), 10514 states have internal predecessors, (40364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10515 states to 10515 states and 40364 transitions. [2025-04-13 18:56:56,387 INFO L79 Accepts]: Start accepts. Automaton has 10515 states and 40364 transitions. Word has length 54 [2025-04-13 18:56:56,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:56,387 INFO L485 AbstractCegarLoop]: Abstraction has 10515 states and 40364 transitions. [2025-04-13 18:56:56,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:56,387 INFO L278 IsEmpty]: Start isEmpty. Operand 10515 states and 40364 transitions. [2025-04-13 18:56:56,402 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:56,402 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:56,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:56,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2025-04-13 18:56:56,403 INFO L403 AbstractCegarLoop]: === Iteration 206 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:56,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash 703958554, now seen corresponding path program 206 times [2025-04-13 18:56:56,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:56,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268487298] [2025-04-13 18:56:56,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:56:56,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:56,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:56,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:56,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:56:56,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:56:56,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:56,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268487298] [2025-04-13 18:56:56,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268487298] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:56,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:56,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:56,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267595618] [2025-04-13 18:56:56,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:56,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:56,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:56,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:56,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:56,991 INFO L87 Difference]: Start difference. First operand 10515 states and 40364 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:57,951 INFO L93 Difference]: Finished difference Result 19865 states and 73177 transitions. [2025-04-13 18:56:57,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:56:57,951 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:57,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:58,016 INFO L225 Difference]: With dead ends: 19865 [2025-04-13 18:56:58,016 INFO L226 Difference]: Without dead ends: 19795 [2025-04-13 18:56:58,020 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:56:58,021 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 316 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:58,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 548 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:58,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19795 states. [2025-04-13 18:56:58,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19795 to 10526. [2025-04-13 18:56:58,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10526 states, 10525 states have (on average 3.837624703087886) internal successors, (40391), 10525 states have internal predecessors, (40391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10526 states to 10526 states and 40391 transitions. [2025-04-13 18:56:58,253 INFO L79 Accepts]: Start accepts. Automaton has 10526 states and 40391 transitions. Word has length 54 [2025-04-13 18:56:58,254 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:58,254 INFO L485 AbstractCegarLoop]: Abstraction has 10526 states and 40391 transitions. [2025-04-13 18:56:58,254 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:58,254 INFO L278 IsEmpty]: Start isEmpty. Operand 10526 states and 40391 transitions. [2025-04-13 18:56:58,270 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:56:58,270 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:58,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:58,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2025-04-13 18:56:58,270 INFO L403 AbstractCegarLoop]: === Iteration 207 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:58,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1424540772, now seen corresponding path program 207 times [2025-04-13 18:56:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:58,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656800655] [2025-04-13 18:56:58,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:56:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:58,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:56:58,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:56:58,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:56:58,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:58,869 INFO L134 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:56:58,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:58,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656800655] [2025-04-13 18:56:58,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656800655] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:58,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:58,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:56:58,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523258815] [2025-04-13 18:56:58,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:58,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:56:58,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:58,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:56:58,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:56:58,870 INFO L87 Difference]: Start difference. First operand 10526 states and 40391 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:59,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:59,745 INFO L93 Difference]: Finished difference Result 18858 states and 69854 transitions. [2025-04-13 18:56:59,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:56:59,745 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:56:59,745 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:59,807 INFO L225 Difference]: With dead ends: 18858 [2025-04-13 18:56:59,807 INFO L226 Difference]: Without dead ends: 18782 [2025-04-13 18:56:59,812 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:56:59,812 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 307 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:59,812 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 527 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:56:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18782 states. [2025-04-13 18:56:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18782 to 10518. [2025-04-13 18:56:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10518 states, 10517 states have (on average 3.8382618617476467) internal successors, (40367), 10517 states have internal predecessors, (40367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10518 states to 10518 states and 40367 transitions. [2025-04-13 18:57:00,143 INFO L79 Accepts]: Start accepts. Automaton has 10518 states and 40367 transitions. Word has length 54 [2025-04-13 18:57:00,143 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:00,143 INFO L485 AbstractCegarLoop]: Abstraction has 10518 states and 40367 transitions. [2025-04-13 18:57:00,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:00,143 INFO L278 IsEmpty]: Start isEmpty. Operand 10518 states and 40367 transitions. [2025-04-13 18:57:00,159 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:00,159 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:00,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:00,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2025-04-13 18:57:00,159 INFO L403 AbstractCegarLoop]: === Iteration 208 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:00,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:00,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1706022408, now seen corresponding path program 208 times [2025-04-13 18:57:00,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:00,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776682510] [2025-04-13 18:57:00,160 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:57:00,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:00,162 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:57:00,175 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:00,175 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:57:00,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:00,727 INFO L134 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:57:00,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:00,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776682510] [2025-04-13 18:57:00,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776682510] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:00,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:00,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:00,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270147077] [2025-04-13 18:57:00,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:00,727 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:00,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:00,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:00,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:00,728 INFO L87 Difference]: Start difference. First operand 10518 states and 40367 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:01,639 INFO L93 Difference]: Finished difference Result 19810 states and 73031 transitions. [2025-04-13 18:57:01,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:01,640 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:01,640 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:01,704 INFO L225 Difference]: With dead ends: 19810 [2025-04-13 18:57:01,704 INFO L226 Difference]: Without dead ends: 19728 [2025-04-13 18:57:01,711 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:01,711 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 299 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:01,711 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 554 Invalid, 1584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:01,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19728 states. [2025-04-13 18:57:01,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19728 to 10507. [2025-04-13 18:57:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10507 states, 10506 states have (on average 3.8393299067199695) internal successors, (40336), 10506 states have internal predecessors, (40336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10507 states to 10507 states and 40336 transitions. [2025-04-13 18:57:01,953 INFO L79 Accepts]: Start accepts. Automaton has 10507 states and 40336 transitions. Word has length 54 [2025-04-13 18:57:01,953 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:01,953 INFO L485 AbstractCegarLoop]: Abstraction has 10507 states and 40336 transitions. [2025-04-13 18:57:01,953 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:01,953 INFO L278 IsEmpty]: Start isEmpty. Operand 10507 states and 40336 transitions. [2025-04-13 18:57:01,969 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:01,969 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:01,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:01,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2025-04-13 18:57:01,969 INFO L403 AbstractCegarLoop]: === Iteration 209 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:01,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:01,969 INFO L85 PathProgramCache]: Analyzing trace with hash 341166694, now seen corresponding path program 209 times [2025-04-13 18:57:01,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:01,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123017332] [2025-04-13 18:57:01,969 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:57:01,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:01,972 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:01,982 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:01,982 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:57:01,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:02,597 INFO L134 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:57:02,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:02,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123017332] [2025-04-13 18:57:02,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123017332] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:02,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:02,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:02,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131952257] [2025-04-13 18:57:02,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:02,598 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:02,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:02,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:02,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:02,598 INFO L87 Difference]: Start difference. First operand 10507 states and 40336 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:03,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:03,486 INFO L93 Difference]: Finished difference Result 18799 states and 69679 transitions. [2025-04-13 18:57:03,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:03,486 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:03,486 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:03,541 INFO L225 Difference]: With dead ends: 18799 [2025-04-13 18:57:03,542 INFO L226 Difference]: Without dead ends: 18729 [2025-04-13 18:57:03,548 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:03,548 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 297 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:03,548 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 576 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:03,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18729 states. [2025-04-13 18:57:03,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18729 to 10517. [2025-04-13 18:57:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10517 states, 10516 states have (on average 3.838056295169266) internal successors, (40361), 10516 states have internal predecessors, (40361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10517 states to 10517 states and 40361 transitions. [2025-04-13 18:57:03,802 INFO L79 Accepts]: Start accepts. Automaton has 10517 states and 40361 transitions. Word has length 54 [2025-04-13 18:57:03,802 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:03,802 INFO L485 AbstractCegarLoop]: Abstraction has 10517 states and 40361 transitions. [2025-04-13 18:57:03,802 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:03,802 INFO L278 IsEmpty]: Start isEmpty. Operand 10517 states and 40361 transitions. [2025-04-13 18:57:03,817 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:03,817 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:03,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:03,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2025-04-13 18:57:03,817 INFO L403 AbstractCegarLoop]: === Iteration 210 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:03,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:03,818 INFO L85 PathProgramCache]: Analyzing trace with hash -97653702, now seen corresponding path program 210 times [2025-04-13 18:57:03,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:03,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851768339] [2025-04-13 18:57:03,818 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:57:03,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:03,820 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:03,830 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:03,830 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:57:03,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:04,419 INFO L134 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:57:04,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:04,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851768339] [2025-04-13 18:57:04,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851768339] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:04,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:04,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:04,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189532828] [2025-04-13 18:57:04,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:04,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:04,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:04,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:04,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:04,420 INFO L87 Difference]: Start difference. First operand 10517 states and 40361 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:05,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:05,241 INFO L93 Difference]: Finished difference Result 19763 states and 72891 transitions. [2025-04-13 18:57:05,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:05,241 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:05,241 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:05,304 INFO L225 Difference]: With dead ends: 19763 [2025-04-13 18:57:05,304 INFO L226 Difference]: Without dead ends: 19699 [2025-04-13 18:57:05,310 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:05,310 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 325 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:05,310 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 503 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:05,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19699 states. [2025-04-13 18:57:05,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19699 to 10525. [2025-04-13 18:57:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10525 states, 10524 states have (on average 3.837039148612695) internal successors, (40381), 10524 states have internal predecessors, (40381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10525 states to 10525 states and 40381 transitions. [2025-04-13 18:57:05,541 INFO L79 Accepts]: Start accepts. Automaton has 10525 states and 40381 transitions. Word has length 54 [2025-04-13 18:57:05,541 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:05,541 INFO L485 AbstractCegarLoop]: Abstraction has 10525 states and 40381 transitions. [2025-04-13 18:57:05,541 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:05,541 INFO L278 IsEmpty]: Start isEmpty. Operand 10525 states and 40381 transitions. [2025-04-13 18:57:05,557 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:05,557 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:05,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:05,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2025-04-13 18:57:05,557 INFO L403 AbstractCegarLoop]: === Iteration 211 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:05,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1261742660, now seen corresponding path program 211 times [2025-04-13 18:57:05,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:05,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339722806] [2025-04-13 18:57:05,558 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:57:05,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:05,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:05,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:05,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:57:05,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:57:06,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:06,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339722806] [2025-04-13 18:57:06,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339722806] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:06,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:06,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:06,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964420618] [2025-04-13 18:57:06,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:06,125 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:06,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:06,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:06,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:06,125 INFO L87 Difference]: Start difference. First operand 10525 states and 40381 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:07,043 INFO L93 Difference]: Finished difference Result 18757 states and 69571 transitions. [2025-04-13 18:57:07,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:07,044 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:07,044 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:07,100 INFO L225 Difference]: With dead ends: 18757 [2025-04-13 18:57:07,100 INFO L226 Difference]: Without dead ends: 18675 [2025-04-13 18:57:07,103 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:07,103 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 279 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:07,103 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 563 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18675 states. [2025-04-13 18:57:07,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18675 to 10511. [2025-04-13 18:57:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10511 states, 10510 states have (on average 3.838629876308278) internal successors, (40344), 10510 states have internal predecessors, (40344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10511 states to 10511 states and 40344 transitions. [2025-04-13 18:57:07,309 INFO L79 Accepts]: Start accepts. Automaton has 10511 states and 40344 transitions. Word has length 54 [2025-04-13 18:57:07,309 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:07,309 INFO L485 AbstractCegarLoop]: Abstraction has 10511 states and 40344 transitions. [2025-04-13 18:57:07,309 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:07,309 INFO L278 IsEmpty]: Start isEmpty. Operand 10511 states and 40344 transitions. [2025-04-13 18:57:07,324 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:07,324 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:07,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:07,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2025-04-13 18:57:07,325 INFO L403 AbstractCegarLoop]: === Iteration 212 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:07,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:07,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1543224296, now seen corresponding path program 212 times [2025-04-13 18:57:07,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:07,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87401243] [2025-04-13 18:57:07,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:57:07,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:07,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:07,338 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:07,338 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:57:07,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:07,902 INFO L134 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:57:07,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:07,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87401243] [2025-04-13 18:57:07,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87401243] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:07,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:07,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:07,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165704745] [2025-04-13 18:57:07,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:07,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:07,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:07,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:07,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:07,902 INFO L87 Difference]: Start difference. First operand 10511 states and 40344 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:08,718 INFO L93 Difference]: Finished difference Result 19708 states and 72752 transitions. [2025-04-13 18:57:08,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:08,718 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:08,718 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:08,779 INFO L225 Difference]: With dead ends: 19708 [2025-04-13 18:57:08,779 INFO L226 Difference]: Without dead ends: 19625 [2025-04-13 18:57:08,785 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:08,785 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 308 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:08,785 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 498 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19625 states. [2025-04-13 18:57:08,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19625 to 10499. [2025-04-13 18:57:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10499 states, 10498 states have (on average 3.839969518003429) internal successors, (40312), 10498 states have internal predecessors, (40312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10499 states to 10499 states and 40312 transitions. [2025-04-13 18:57:09,028 INFO L79 Accepts]: Start accepts. Automaton has 10499 states and 40312 transitions. Word has length 54 [2025-04-13 18:57:09,028 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:09,028 INFO L485 AbstractCegarLoop]: Abstraction has 10499 states and 40312 transitions. [2025-04-13 18:57:09,028 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:09,028 INFO L278 IsEmpty]: Start isEmpty. Operand 10499 states and 40312 transitions. [2025-04-13 18:57:09,045 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:09,045 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:09,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:09,045 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2025-04-13 18:57:09,045 INFO L403 AbstractCegarLoop]: === Iteration 213 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:09,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:09,045 INFO L85 PathProgramCache]: Analyzing trace with hash -372135710, now seen corresponding path program 213 times [2025-04-13 18:57:09,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:09,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112502863] [2025-04-13 18:57:09,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:57:09,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:09,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:09,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:09,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:57:09,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:09,658 INFO L134 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:57:09,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:09,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112502863] [2025-04-13 18:57:09,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112502863] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:09,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:09,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:09,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140002549] [2025-04-13 18:57:09,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:09,659 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:09,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:09,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:09,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:09,659 INFO L87 Difference]: Start difference. First operand 10499 states and 40312 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:10,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:10,660 INFO L93 Difference]: Finished difference Result 18863 states and 69879 transitions. [2025-04-13 18:57:10,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:10,660 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:10,660 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:10,725 INFO L225 Difference]: With dead ends: 18863 [2025-04-13 18:57:10,725 INFO L226 Difference]: Without dead ends: 18751 [2025-04-13 18:57:10,732 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:10,732 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 312 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:10,732 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 538 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:57:10,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18751 states. [2025-04-13 18:57:10,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18751 to 10523. [2025-04-13 18:57:10,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10523 states, 10522 states have (on average 3.8369131343850977) internal successors, (40372), 10522 states have internal predecessors, (40372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10523 states to 10523 states and 40372 transitions. [2025-04-13 18:57:10,986 INFO L79 Accepts]: Start accepts. Automaton has 10523 states and 40372 transitions. Word has length 54 [2025-04-13 18:57:10,987 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:10,987 INFO L485 AbstractCegarLoop]: Abstraction has 10523 states and 40372 transitions. [2025-04-13 18:57:10,987 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:10,987 INFO L278 IsEmpty]: Start isEmpty. Operand 10523 states and 40372 transitions. [2025-04-13 18:57:11,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:11,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:11,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] [2025-04-13 18:57:11,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2025-04-13 18:57:11,003 INFO L403 AbstractCegarLoop]: === Iteration 214 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:11,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:11,003 INFO L85 PathProgramCache]: Analyzing trace with hash -711279946, now seen corresponding path program 214 times [2025-04-13 18:57:11,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:11,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057773509] [2025-04-13 18:57:11,004 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:57:11,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:11,006 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:57:11,017 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:11,017 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:57:11,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:11,592 INFO L134 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:57:11,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:11,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057773509] [2025-04-13 18:57:11,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057773509] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:11,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:11,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:11,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293551177] [2025-04-13 18:57:11,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:11,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:11,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:11,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:11,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:11,593 INFO L87 Difference]: Start difference. First operand 10523 states and 40372 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:12,559 INFO L93 Difference]: Finished difference Result 19888 states and 73265 transitions. [2025-04-13 18:57:12,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:12,559 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:12,559 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:12,619 INFO L225 Difference]: With dead ends: 19888 [2025-04-13 18:57:12,619 INFO L226 Difference]: Without dead ends: 19752 [2025-04-13 18:57:12,625 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:12,626 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 318 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:12,626 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 516 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1422 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:12,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19752 states. [2025-04-13 18:57:12,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19752 to 10556. [2025-04-13 18:57:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10556 states, 10555 states have (on average 3.832591189009948) internal successors, (40453), 10555 states have internal predecessors, (40453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 40453 transitions. [2025-04-13 18:57:12,872 INFO L79 Accepts]: Start accepts. Automaton has 10556 states and 40453 transitions. Word has length 54 [2025-04-13 18:57:12,873 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:12,873 INFO L485 AbstractCegarLoop]: Abstraction has 10556 states and 40453 transitions. [2025-04-13 18:57:12,873 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:12,873 INFO L278 IsEmpty]: Start isEmpty. Operand 10556 states and 40453 transitions. [2025-04-13 18:57:12,891 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:12,891 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:12,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:12,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2025-04-13 18:57:12,891 INFO L403 AbstractCegarLoop]: === Iteration 215 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:12,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:12,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2077604604, now seen corresponding path program 215 times [2025-04-13 18:57:12,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:12,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969591084] [2025-04-13 18:57:12,892 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:57:12,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:12,894 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:12,906 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:12,906 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:57:12,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:13,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:57:13,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:13,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969591084] [2025-04-13 18:57:13,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969591084] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:13,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:13,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:13,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140831653] [2025-04-13 18:57:13,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:13,476 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:13,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:13,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:13,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:13,476 INFO L87 Difference]: Start difference. First operand 10556 states and 40453 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:14,417 INFO L93 Difference]: Finished difference Result 18860 states and 69832 transitions. [2025-04-13 18:57:14,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:14,417 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:14,417 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:14,483 INFO L225 Difference]: With dead ends: 18860 [2025-04-13 18:57:14,483 INFO L226 Difference]: Without dead ends: 18796 [2025-04-13 18:57:14,491 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:14,491 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 315 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:14,491 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 536 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:14,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18796 states. [2025-04-13 18:57:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18796 to 10564. [2025-04-13 18:57:14,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10564 states, 10563 states have (on average 3.83158193694973) internal successors, (40473), 10563 states have internal predecessors, (40473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:14,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10564 states to 10564 states and 40473 transitions. [2025-04-13 18:57:14,744 INFO L79 Accepts]: Start accepts. Automaton has 10564 states and 40473 transitions. Word has length 54 [2025-04-13 18:57:14,744 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:14,744 INFO L485 AbstractCegarLoop]: Abstraction has 10564 states and 40473 transitions. [2025-04-13 18:57:14,744 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:14,744 INFO L278 IsEmpty]: Start isEmpty. Operand 10564 states and 40473 transitions. [2025-04-13 18:57:14,761 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:14,761 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:14,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:14,761 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2025-04-13 18:57:14,761 INFO L403 AbstractCegarLoop]: === Iteration 216 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:14,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:14,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1878218456, now seen corresponding path program 216 times [2025-04-13 18:57:14,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:14,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155225644] [2025-04-13 18:57:14,762 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:57:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:14,764 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:14,774 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:14,774 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:57:14,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:15,407 INFO L134 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:57:15,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:15,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155225644] [2025-04-13 18:57:15,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155225644] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:15,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:15,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:15,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838607053] [2025-04-13 18:57:15,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:15,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:15,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:15,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:15,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:15,408 INFO L87 Difference]: Start difference. First operand 10564 states and 40473 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:16,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:16,298 INFO L93 Difference]: Finished difference Result 19842 states and 73097 transitions. [2025-04-13 18:57:16,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:16,299 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:16,299 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:16,368 INFO L225 Difference]: With dead ends: 19842 [2025-04-13 18:57:16,368 INFO L226 Difference]: Without dead ends: 19772 [2025-04-13 18:57:16,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:16,376 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 317 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:16,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 514 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:16,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19772 states. [2025-04-13 18:57:16,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19772 to 10575. [2025-04-13 18:57:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10575 states, 10574 states have (on average 3.830149423113297) internal successors, (40500), 10574 states have internal predecessors, (40500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10575 states to 10575 states and 40500 transitions. [2025-04-13 18:57:16,681 INFO L79 Accepts]: Start accepts. Automaton has 10575 states and 40500 transitions. Word has length 54 [2025-04-13 18:57:16,681 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:16,681 INFO L485 AbstractCegarLoop]: Abstraction has 10575 states and 40500 transitions. [2025-04-13 18:57:16,681 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:16,681 INFO L278 IsEmpty]: Start isEmpty. Operand 10575 states and 40500 transitions. [2025-04-13 18:57:16,697 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:16,697 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:16,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:16,697 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2025-04-13 18:57:16,697 INFO L403 AbstractCegarLoop]: === Iteration 217 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:16,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:16,698 INFO L85 PathProgramCache]: Analyzing trace with hash -192618270, now seen corresponding path program 217 times [2025-04-13 18:57:16,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:16,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612523376] [2025-04-13 18:57:16,698 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:57:16,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:16,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:16,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:16,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:57:16,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:17,266 INFO L134 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:57:17,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:17,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612523376] [2025-04-13 18:57:17,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612523376] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:17,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:17,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:17,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987498963] [2025-04-13 18:57:17,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:17,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:17,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:17,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:17,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:17,267 INFO L87 Difference]: Start difference. First operand 10575 states and 40500 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:18,182 INFO L93 Difference]: Finished difference Result 18807 states and 69690 transitions. [2025-04-13 18:57:18,182 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:18,182 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:18,182 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:18,243 INFO L225 Difference]: With dead ends: 18807 [2025-04-13 18:57:18,243 INFO L226 Difference]: Without dead ends: 18695 [2025-04-13 18:57:18,248 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:18,248 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 289 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:18,248 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 539 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:18,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18695 states. [2025-04-13 18:57:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18695 to 10531. [2025-04-13 18:57:18,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10531 states, 10530 states have (on average 3.8343779677113012) internal successors, (40376), 10530 states have internal predecessors, (40376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10531 states to 10531 states and 40376 transitions. [2025-04-13 18:57:18,482 INFO L79 Accepts]: Start accepts. Automaton has 10531 states and 40376 transitions. Word has length 54 [2025-04-13 18:57:18,482 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:18,482 INFO L485 AbstractCegarLoop]: Abstraction has 10531 states and 40376 transitions. [2025-04-13 18:57:18,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:18,482 INFO L278 IsEmpty]: Start isEmpty. Operand 10531 states and 40376 transitions. [2025-04-13 18:57:18,498 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:18,498 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:18,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:18,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2025-04-13 18:57:18,498 INFO L403 AbstractCegarLoop]: === Iteration 218 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:18,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:18,499 INFO L85 PathProgramCache]: Analyzing trace with hash -531762506, now seen corresponding path program 218 times [2025-04-13 18:57:18,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:18,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941926281] [2025-04-13 18:57:18,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:57:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:18,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:18,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:18,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:57:18,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:19,150 INFO L134 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:57:19,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:19,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941926281] [2025-04-13 18:57:19,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941926281] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:19,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:19,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:19,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112541320] [2025-04-13 18:57:19,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:19,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:19,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:19,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:19,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:19,151 INFO L87 Difference]: Start difference. First operand 10531 states and 40376 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:20,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:20,077 INFO L93 Difference]: Finished difference Result 19728 states and 72784 transitions. [2025-04-13 18:57:20,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:20,077 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:20,077 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:20,138 INFO L225 Difference]: With dead ends: 19728 [2025-04-13 18:57:20,138 INFO L226 Difference]: Without dead ends: 19601 [2025-04-13 18:57:20,144 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:20,144 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 289 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:20,144 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 527 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:20,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19601 states. [2025-04-13 18:57:20,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19601 to 10475. [2025-04-13 18:57:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10475 states, 10474 states have (on average 3.840366622111896) internal successors, (40224), 10474 states have internal predecessors, (40224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10475 states to 10475 states and 40224 transitions. [2025-04-13 18:57:20,384 INFO L79 Accepts]: Start accepts. Automaton has 10475 states and 40224 transitions. Word has length 54 [2025-04-13 18:57:20,385 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:20,385 INFO L485 AbstractCegarLoop]: Abstraction has 10475 states and 40224 transitions. [2025-04-13 18:57:20,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:20,385 INFO L278 IsEmpty]: Start isEmpty. Operand 10475 states and 40224 transitions. [2025-04-13 18:57:20,401 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:20,401 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:20,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:20,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable217 [2025-04-13 18:57:20,401 INFO L403 AbstractCegarLoop]: === Iteration 219 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:20,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash 151389076, now seen corresponding path program 219 times [2025-04-13 18:57:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:20,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521784376] [2025-04-13 18:57:20,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:57:20,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:20,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:20,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:20,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:57:20,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:21,023 INFO L134 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:57:21,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:21,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521784376] [2025-04-13 18:57:21,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521784376] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:21,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:21,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:21,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068344363] [2025-04-13 18:57:21,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:21,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:21,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:21,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:21,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:21,024 INFO L87 Difference]: Start difference. First operand 10475 states and 40224 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:21,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:21,924 INFO L93 Difference]: Finished difference Result 18811 states and 69705 transitions. [2025-04-13 18:57:21,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:21,925 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:21,925 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:21,985 INFO L225 Difference]: With dead ends: 18811 [2025-04-13 18:57:21,985 INFO L226 Difference]: Without dead ends: 18747 [2025-04-13 18:57:21,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:21,992 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 301 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:21,992 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 533 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18747 states. [2025-04-13 18:57:22,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18747 to 10495. [2025-04-13 18:57:22,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10495 states, 10494 states have (on average 3.8395273489613113) internal successors, (40292), 10494 states have internal predecessors, (40292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:22,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10495 states to 10495 states and 40292 transitions. [2025-04-13 18:57:22,243 INFO L79 Accepts]: Start accepts. Automaton has 10495 states and 40292 transitions. Word has length 54 [2025-04-13 18:57:22,243 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:22,243 INFO L485 AbstractCegarLoop]: Abstraction has 10495 states and 40292 transitions. [2025-04-13 18:57:22,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:22,243 INFO L278 IsEmpty]: Start isEmpty. Operand 10495 states and 40292 transitions. [2025-04-13 18:57:22,258 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:22,258 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:22,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:57:22,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2025-04-13 18:57:22,258 INFO L403 AbstractCegarLoop]: === Iteration 220 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:22,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1651892520, now seen corresponding path program 220 times [2025-04-13 18:57:22,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:22,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127570534] [2025-04-13 18:57:22,259 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:57:22,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:22,261 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:57:22,275 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:22,275 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:57:22,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:22,941 INFO L134 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:57:22,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:22,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127570534] [2025-04-13 18:57:22,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127570534] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:22,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:22,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:22,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702470503] [2025-04-13 18:57:22,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:22,941 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:22,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:22,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:22,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:22,942 INFO L87 Difference]: Start difference. First operand 10495 states and 40292 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:23,830 INFO L93 Difference]: Finished difference Result 19801 states and 73001 transitions. [2025-04-13 18:57:23,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:23,831 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:23,831 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:23,892 INFO L225 Difference]: With dead ends: 19801 [2025-04-13 18:57:23,892 INFO L226 Difference]: Without dead ends: 19731 [2025-04-13 18:57:23,898 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:23,899 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 305 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:23,899 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 532 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19731 states. [2025-04-13 18:57:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19731 to 10515. [2025-04-13 18:57:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10515 states, 10514 states have (on average 3.8386912687844776) internal successors, (40360), 10514 states have internal predecessors, (40360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10515 states to 10515 states and 40360 transitions. [2025-04-13 18:57:24,134 INFO L79 Accepts]: Start accepts. Automaton has 10515 states and 40360 transitions. Word has length 54 [2025-04-13 18:57:24,134 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:24,135 INFO L485 AbstractCegarLoop]: Abstraction has 10515 states and 40360 transitions. [2025-04-13 18:57:24,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:24,135 INFO L278 IsEmpty]: Start isEmpty. Operand 10515 states and 40360 transitions. [2025-04-13 18:57:24,150 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:24,151 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:24,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] [2025-04-13 18:57:24,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219 [2025-04-13 18:57:24,151 INFO L403 AbstractCegarLoop]: === Iteration 221 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:24,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:24,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1121050996, now seen corresponding path program 221 times [2025-04-13 18:57:24,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:24,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27683348] [2025-04-13 18:57:24,151 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:57:24,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:24,154 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:24,164 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:24,164 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:57:24,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:57:24,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:24,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27683348] [2025-04-13 18:57:24,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27683348] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:24,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:24,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:24,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377803314] [2025-04-13 18:57:24,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:24,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:24,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:24,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:24,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:24,744 INFO L87 Difference]: Start difference. First operand 10515 states and 40360 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:25,580 INFO L93 Difference]: Finished difference Result 18837 states and 69782 transitions. [2025-04-13 18:57:25,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:25,580 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:25,580 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:25,709 INFO L225 Difference]: With dead ends: 18837 [2025-04-13 18:57:25,709 INFO L226 Difference]: Without dead ends: 18759 [2025-04-13 18:57:25,712 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:25,712 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 309 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:25,712 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 528 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18759 states. [2025-04-13 18:57:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18759 to 10507. [2025-04-13 18:57:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10507 states, 10506 states have (on average 3.8393299067199695) internal successors, (40336), 10506 states have internal predecessors, (40336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10507 states to 10507 states and 40336 transitions. [2025-04-13 18:57:25,903 INFO L79 Accepts]: Start accepts. Automaton has 10507 states and 40336 transitions. Word has length 54 [2025-04-13 18:57:25,903 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:25,903 INFO L485 AbstractCegarLoop]: Abstraction has 10507 states and 40336 transitions. [2025-04-13 18:57:25,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:25,904 INFO L278 IsEmpty]: Start isEmpty. Operand 10507 states and 40336 transitions. [2025-04-13 18:57:25,919 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:25,919 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:25,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] [2025-04-13 18:57:25,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2025-04-13 18:57:25,919 INFO L403 AbstractCegarLoop]: === Iteration 222 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:25,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash 682230600, now seen corresponding path program 222 times [2025-04-13 18:57:25,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:25,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604405581] [2025-04-13 18:57:25,920 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:57:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:25,922 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:25,931 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:25,931 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:57:25,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:26,514 INFO L134 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:57:26,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:26,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604405581] [2025-04-13 18:57:26,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604405581] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:26,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:26,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:26,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491214110] [2025-04-13 18:57:26,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:26,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:26,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:26,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:26,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:26,515 INFO L87 Difference]: Start difference. First operand 10507 states and 40336 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:27,358 INFO L93 Difference]: Finished difference Result 19787 states and 72952 transitions. [2025-04-13 18:57:27,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:27,358 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:27,358 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:27,419 INFO L225 Difference]: With dead ends: 19787 [2025-04-13 18:57:27,419 INFO L226 Difference]: Without dead ends: 19715 [2025-04-13 18:57:27,425 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:27,426 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 314 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:27,426 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 519 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:27,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19715 states. [2025-04-13 18:57:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19715 to 10499. [2025-04-13 18:57:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10499 states, 10498 states have (on average 3.839969518003429) internal successors, (40312), 10498 states have internal predecessors, (40312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10499 states to 10499 states and 40312 transitions. [2025-04-13 18:57:27,651 INFO L79 Accepts]: Start accepts. Automaton has 10499 states and 40312 transitions. Word has length 54 [2025-04-13 18:57:27,651 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:27,651 INFO L485 AbstractCegarLoop]: Abstraction has 10499 states and 40312 transitions. [2025-04-13 18:57:27,652 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:27,652 INFO L278 IsEmpty]: Start isEmpty. Operand 10499 states and 40312 transitions. [2025-04-13 18:57:27,667 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:27,667 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:27,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:27,667 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2025-04-13 18:57:27,667 INFO L403 AbstractCegarLoop]: === Iteration 223 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:27,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:27,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1375527050, now seen corresponding path program 223 times [2025-04-13 18:57:27,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:27,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479677330] [2025-04-13 18:57:27,668 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:57:27,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:27,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:27,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:27,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:57:27,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:28,282 INFO L134 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:57:28,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:28,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479677330] [2025-04-13 18:57:28,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479677330] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:28,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:28,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:28,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128529393] [2025-04-13 18:57:28,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:28,282 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:28,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:28,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:28,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:28,283 INFO L87 Difference]: Start difference. First operand 10499 states and 40312 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:29,191 INFO L93 Difference]: Finished difference Result 18891 states and 69918 transitions. [2025-04-13 18:57:29,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:29,191 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:29,191 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:29,254 INFO L225 Difference]: With dead ends: 18891 [2025-04-13 18:57:29,254 INFO L226 Difference]: Without dead ends: 18827 [2025-04-13 18:57:29,260 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:29,260 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 313 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:29,260 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 514 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18827 states. [2025-04-13 18:57:29,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18827 to 10507. [2025-04-13 18:57:29,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10507 states, 10506 states have (on average 3.8389491719017705) internal successors, (40332), 10506 states have internal predecessors, (40332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10507 states to 10507 states and 40332 transitions. [2025-04-13 18:57:29,505 INFO L79 Accepts]: Start accepts. Automaton has 10507 states and 40332 transitions. Word has length 54 [2025-04-13 18:57:29,505 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:29,506 INFO L485 AbstractCegarLoop]: Abstraction has 10507 states and 40332 transitions. [2025-04-13 18:57:29,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:29,506 INFO L278 IsEmpty]: Start isEmpty. Operand 10507 states and 40332 transitions. [2025-04-13 18:57:29,522 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:29,522 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:29,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:29,522 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222 [2025-04-13 18:57:29,522 INFO L403 AbstractCegarLoop]: === Iteration 224 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:29,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:29,522 INFO L85 PathProgramCache]: Analyzing trace with hash -211122934, now seen corresponding path program 224 times [2025-04-13 18:57:29,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:29,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106087236] [2025-04-13 18:57:29,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:57:29,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:29,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:29,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:29,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:57:29,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:57:30,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:30,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106087236] [2025-04-13 18:57:30,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106087236] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:30,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:30,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:30,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926839011] [2025-04-13 18:57:30,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:30,191 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:30,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:30,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:30,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:30,191 INFO L87 Difference]: Start difference. First operand 10507 states and 40332 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:31,032 INFO L93 Difference]: Finished difference Result 19875 states and 73183 transitions. [2025-04-13 18:57:31,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:31,032 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:31,032 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:31,097 INFO L225 Difference]: With dead ends: 19875 [2025-04-13 18:57:31,097 INFO L226 Difference]: Without dead ends: 19805 [2025-04-13 18:57:31,103 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:31,103 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 325 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:31,103 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 504 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:31,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19805 states. [2025-04-13 18:57:31,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19805 to 10518. [2025-04-13 18:57:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10518 states, 10517 states have (on average 3.8375011885518684) internal successors, (40359), 10517 states have internal predecessors, (40359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10518 states to 10518 states and 40359 transitions. [2025-04-13 18:57:31,334 INFO L79 Accepts]: Start accepts. Automaton has 10518 states and 40359 transitions. Word has length 54 [2025-04-13 18:57:31,334 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:31,334 INFO L485 AbstractCegarLoop]: Abstraction has 10518 states and 40359 transitions. [2025-04-13 18:57:31,334 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:31,334 INFO L278 IsEmpty]: Start isEmpty. Operand 10518 states and 40359 transitions. [2025-04-13 18:57:31,350 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:31,350 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:31,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] [2025-04-13 18:57:31,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223 [2025-04-13 18:57:31,350 INFO L403 AbstractCegarLoop]: === Iteration 225 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:31,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:31,350 INFO L85 PathProgramCache]: Analyzing trace with hash 509459284, now seen corresponding path program 225 times [2025-04-13 18:57:31,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:31,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903023044] [2025-04-13 18:57:31,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:57:31,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:31,353 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:31,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:31,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:57:31,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:31,971 INFO L134 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:57:31,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:31,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903023044] [2025-04-13 18:57:31,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903023044] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:31,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:31,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:31,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803649043] [2025-04-13 18:57:31,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:31,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:31,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:31,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:31,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:31,972 INFO L87 Difference]: Start difference. First operand 10518 states and 40359 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:32,850 INFO L93 Difference]: Finished difference Result 18858 states and 69836 transitions. [2025-04-13 18:57:32,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:32,850 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:32,850 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:32,909 INFO L225 Difference]: With dead ends: 18858 [2025-04-13 18:57:32,909 INFO L226 Difference]: Without dead ends: 18782 [2025-04-13 18:57:32,915 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:32,915 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 315 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:32,915 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 482 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:32,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18782 states. [2025-04-13 18:57:33,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18782 to 10510. [2025-04-13 18:57:33,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10510 states, 10509 states have (on average 3.8381387382243792) internal successors, (40335), 10509 states have internal predecessors, (40335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10510 states to 10510 states and 40335 transitions. [2025-04-13 18:57:33,136 INFO L79 Accepts]: Start accepts. Automaton has 10510 states and 40335 transitions. Word has length 54 [2025-04-13 18:57:33,136 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:33,136 INFO L485 AbstractCegarLoop]: Abstraction has 10510 states and 40335 transitions. [2025-04-13 18:57:33,136 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:33,136 INFO L278 IsEmpty]: Start isEmpty. Operand 10510 states and 40335 transitions. [2025-04-13 18:57:33,152 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:33,152 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:33,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:57:33,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2025-04-13 18:57:33,152 INFO L403 AbstractCegarLoop]: === Iteration 226 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:33,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:33,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1673863400, now seen corresponding path program 226 times [2025-04-13 18:57:33,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:33,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057140012] [2025-04-13 18:57:33,153 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:57:33,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:33,155 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:57:33,168 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:33,168 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:57:33,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:33,739 INFO L134 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:57:33,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:33,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057140012] [2025-04-13 18:57:33,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057140012] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:33,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:33,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:33,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892979223] [2025-04-13 18:57:33,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:33,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:33,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:33,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:33,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:33,740 INFO L87 Difference]: Start difference. First operand 10510 states and 40335 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:34,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:34,586 INFO L93 Difference]: Finished difference Result 19820 states and 73037 transitions. [2025-04-13 18:57:34,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:34,586 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:34,586 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:34,728 INFO L225 Difference]: With dead ends: 19820 [2025-04-13 18:57:34,728 INFO L226 Difference]: Without dead ends: 19738 [2025-04-13 18:57:34,731 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:34,731 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 297 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:34,731 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 487 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19738 states. [2025-04-13 18:57:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19738 to 10499. [2025-04-13 18:57:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10499 states, 10498 states have (on average 3.83920746808916) internal successors, (40304), 10498 states have internal predecessors, (40304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10499 states to 10499 states and 40304 transitions. [2025-04-13 18:57:34,954 INFO L79 Accepts]: Start accepts. Automaton has 10499 states and 40304 transitions. Word has length 54 [2025-04-13 18:57:34,954 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:34,954 INFO L485 AbstractCegarLoop]: Abstraction has 10499 states and 40304 transitions. [2025-04-13 18:57:34,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:34,954 INFO L278 IsEmpty]: Start isEmpty. Operand 10499 states and 40304 transitions. [2025-04-13 18:57:34,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:34,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:34,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:34,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2025-04-13 18:57:34,970 INFO L403 AbstractCegarLoop]: === Iteration 227 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:34,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:34,971 INFO L85 PathProgramCache]: Analyzing trace with hash -573914794, now seen corresponding path program 227 times [2025-04-13 18:57:34,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:34,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442669442] [2025-04-13 18:57:34,971 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:57:34,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:34,974 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:34,984 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:34,984 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:57:34,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:35,605 INFO L134 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:57:35,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:35,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442669442] [2025-04-13 18:57:35,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442669442] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:35,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:35,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:35,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369581312] [2025-04-13 18:57:35,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:35,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:35,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:35,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:35,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:35,606 INFO L87 Difference]: Start difference. First operand 10499 states and 40304 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:36,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:36,483 INFO L93 Difference]: Finished difference Result 18899 states and 69934 transitions. [2025-04-13 18:57:36,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:36,483 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:36,483 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:36,543 INFO L225 Difference]: With dead ends: 18899 [2025-04-13 18:57:36,543 INFO L226 Difference]: Without dead ends: 18829 [2025-04-13 18:57:36,548 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:36,548 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 330 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:36,548 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 532 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18829 states. [2025-04-13 18:57:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18829 to 10509. [2025-04-13 18:57:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10509 states, 10508 states have (on average 3.8379330034259613) internal successors, (40329), 10508 states have internal predecessors, (40329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:36,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10509 states to 10509 states and 40329 transitions. [2025-04-13 18:57:36,885 INFO L79 Accepts]: Start accepts. Automaton has 10509 states and 40329 transitions. Word has length 54 [2025-04-13 18:57:36,886 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:36,886 INFO L485 AbstractCegarLoop]: Abstraction has 10509 states and 40329 transitions. [2025-04-13 18:57:36,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:36,886 INFO L278 IsEmpty]: Start isEmpty. Operand 10509 states and 40329 transitions. [2025-04-13 18:57:36,902 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:36,902 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:36,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:36,902 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2025-04-13 18:57:36,902 INFO L403 AbstractCegarLoop]: === Iteration 228 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:36,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:36,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1012735190, now seen corresponding path program 228 times [2025-04-13 18:57:36,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:36,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703447277] [2025-04-13 18:57:36,903 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:57:36,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:36,906 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:36,916 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:36,916 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:57:36,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:37,493 INFO L134 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:57:37,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:37,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703447277] [2025-04-13 18:57:37,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703447277] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:37,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:37,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:37,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685961006] [2025-04-13 18:57:37,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:37,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:37,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:37,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:37,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:37,494 INFO L87 Difference]: Start difference. First operand 10509 states and 40329 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:38,292 INFO L93 Difference]: Finished difference Result 19868 states and 73153 transitions. [2025-04-13 18:57:38,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:38,293 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:38,293 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:38,353 INFO L225 Difference]: With dead ends: 19868 [2025-04-13 18:57:38,353 INFO L226 Difference]: Without dead ends: 19804 [2025-04-13 18:57:38,359 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:38,359 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 331 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:38,359 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 490 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:57:38,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19804 states. [2025-04-13 18:57:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19804 to 10517. [2025-04-13 18:57:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10517 states, 10516 states have (on average 3.836915176873336) internal successors, (40349), 10516 states have internal predecessors, (40349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10517 states to 10517 states and 40349 transitions. [2025-04-13 18:57:38,595 INFO L79 Accepts]: Start accepts. Automaton has 10517 states and 40349 transitions. Word has length 54 [2025-04-13 18:57:38,595 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:38,595 INFO L485 AbstractCegarLoop]: Abstraction has 10517 states and 40349 transitions. [2025-04-13 18:57:38,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:38,595 INFO L278 IsEmpty]: Start isEmpty. Operand 10517 states and 40349 transitions. [2025-04-13 18:57:38,610 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:38,611 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:38,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:38,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227 [2025-04-13 18:57:38,611 INFO L403 AbstractCegarLoop]: === Iteration 229 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:38,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:38,611 INFO L85 PathProgramCache]: Analyzing trace with hash 346661172, now seen corresponding path program 229 times [2025-04-13 18:57:38,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:38,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221164963] [2025-04-13 18:57:38,611 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:57:38,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:38,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:38,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:38,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:57:38,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:39,275 INFO L134 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:57:39,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:39,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221164963] [2025-04-13 18:57:39,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221164963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:39,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:39,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:39,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882592419] [2025-04-13 18:57:39,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:39,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:39,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:39,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:39,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:39,276 INFO L87 Difference]: Start difference. First operand 10517 states and 40349 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:40,151 INFO L93 Difference]: Finished difference Result 18857 states and 69826 transitions. [2025-04-13 18:57:40,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:40,152 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:40,152 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:40,215 INFO L225 Difference]: With dead ends: 18857 [2025-04-13 18:57:40,216 INFO L226 Difference]: Without dead ends: 18775 [2025-04-13 18:57:40,222 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:40,223 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 278 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:40,223 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 558 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18775 states. [2025-04-13 18:57:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18775 to 10503. [2025-04-13 18:57:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10503 states, 10502 states have (on average 3.8385069510569414) internal successors, (40312), 10502 states have internal predecessors, (40312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10503 states to 10503 states and 40312 transitions. [2025-04-13 18:57:40,471 INFO L79 Accepts]: Start accepts. Automaton has 10503 states and 40312 transitions. Word has length 54 [2025-04-13 18:57:40,471 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:40,471 INFO L485 AbstractCegarLoop]: Abstraction has 10503 states and 40312 transitions. [2025-04-13 18:57:40,471 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:40,471 INFO L278 IsEmpty]: Start isEmpty. Operand 10503 states and 40312 transitions. [2025-04-13 18:57:40,487 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:40,488 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:40,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:40,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228 [2025-04-13 18:57:40,488 INFO L403 AbstractCegarLoop]: === Iteration 230 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:40,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:40,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1836661512, now seen corresponding path program 230 times [2025-04-13 18:57:40,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:40,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575631565] [2025-04-13 18:57:40,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:57:40,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:40,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:40,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:40,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:57:40,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:41,127 INFO L134 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:57:41,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:41,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575631565] [2025-04-13 18:57:41,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575631565] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:41,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:41,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:41,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066369372] [2025-04-13 18:57:41,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:41,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:41,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:41,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:41,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:41,128 INFO L87 Difference]: Start difference. First operand 10503 states and 40312 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:41,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:41,962 INFO L93 Difference]: Finished difference Result 19813 states and 73014 transitions. [2025-04-13 18:57:41,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:41,962 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:41,962 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:42,031 INFO L225 Difference]: With dead ends: 19813 [2025-04-13 18:57:42,031 INFO L226 Difference]: Without dead ends: 19730 [2025-04-13 18:57:42,038 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:42,038 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 315 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:42,038 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 519 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:42,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19730 states. [2025-04-13 18:57:42,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19730 to 10491. [2025-04-13 18:57:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10491 states, 10490 states have (on average 3.8398474737845567) internal successors, (40280), 10490 states have internal predecessors, (40280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10491 states to 10491 states and 40280 transitions. [2025-04-13 18:57:42,303 INFO L79 Accepts]: Start accepts. Automaton has 10491 states and 40280 transitions. Word has length 54 [2025-04-13 18:57:42,303 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:42,303 INFO L485 AbstractCegarLoop]: Abstraction has 10491 states and 40280 transitions. [2025-04-13 18:57:42,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:42,303 INFO L278 IsEmpty]: Start isEmpty. Operand 10491 states and 40280 transitions. [2025-04-13 18:57:42,319 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:42,319 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:42,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:42,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable229 [2025-04-13 18:57:42,319 INFO L403 AbstractCegarLoop]: === Iteration 231 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:42,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:42,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1221089532, now seen corresponding path program 231 times [2025-04-13 18:57:42,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:42,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596223944] [2025-04-13 18:57:42,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:57:42,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:42,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:42,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:42,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:57:42,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:42,910 INFO L134 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:57:42,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:42,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596223944] [2025-04-13 18:57:42,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596223944] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:42,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:42,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:42,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191906151] [2025-04-13 18:57:42,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:42,911 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:42,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:42,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:42,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:42,911 INFO L87 Difference]: Start difference. First operand 10491 states and 40280 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:43,799 INFO L93 Difference]: Finished difference Result 18867 states and 69873 transitions. [2025-04-13 18:57:43,799 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:43,799 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:43,799 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:43,868 INFO L225 Difference]: With dead ends: 18867 [2025-04-13 18:57:43,868 INFO L226 Difference]: Without dead ends: 18803 [2025-04-13 18:57:43,875 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:43,876 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 300 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:43,876 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 469 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:43,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18803 states. [2025-04-13 18:57:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18803 to 10515. [2025-04-13 18:57:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10515 states, 10514 states have (on average 3.8383108236636865) internal successors, (40356), 10514 states have internal predecessors, (40356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10515 states to 10515 states and 40356 transitions. [2025-04-13 18:57:44,151 INFO L79 Accepts]: Start accepts. Automaton has 10515 states and 40356 transitions. Word has length 54 [2025-04-13 18:57:44,151 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:44,152 INFO L485 AbstractCegarLoop]: Abstraction has 10515 states and 40356 transitions. [2025-04-13 18:57:44,152 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:44,152 INFO L278 IsEmpty]: Start isEmpty. Operand 10515 states and 40356 transitions. [2025-04-13 18:57:44,169 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:44,169 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:44,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:44,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2025-04-13 18:57:44,169 INFO L403 AbstractCegarLoop]: === Iteration 232 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:44,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:44,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1560233768, now seen corresponding path program 232 times [2025-04-13 18:57:44,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:44,169 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832116942] [2025-04-13 18:57:44,169 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:57:44,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:44,172 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:57:44,184 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:44,184 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:57:44,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:44,764 INFO L134 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:57:44,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:44,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832116942] [2025-04-13 18:57:44,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832116942] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:44,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:44,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:44,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278661180] [2025-04-13 18:57:44,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:44,764 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:44,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:44,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:44,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:44,764 INFO L87 Difference]: Start difference. First operand 10515 states and 40356 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:45,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:45,735 INFO L93 Difference]: Finished difference Result 19870 states and 73201 transitions. [2025-04-13 18:57:45,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:45,735 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:45,735 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:45,806 INFO L225 Difference]: With dead ends: 19870 [2025-04-13 18:57:45,806 INFO L226 Difference]: Without dead ends: 19800 [2025-04-13 18:57:45,813 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:45,813 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 305 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:45,813 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 514 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:45,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19800 states. [2025-04-13 18:57:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19800 to 10548. [2025-04-13 18:57:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10548 states, 10547 states have (on average 3.8360671280932968) internal successors, (40459), 10547 states have internal predecessors, (40459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10548 states to 10548 states and 40459 transitions. [2025-04-13 18:57:46,136 INFO L79 Accepts]: Start accepts. Automaton has 10548 states and 40459 transitions. Word has length 54 [2025-04-13 18:57:46,137 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:46,137 INFO L485 AbstractCegarLoop]: Abstraction has 10548 states and 40459 transitions. [2025-04-13 18:57:46,137 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:46,137 INFO L278 IsEmpty]: Start isEmpty. Operand 10548 states and 40459 transitions. [2025-04-13 18:57:46,153 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:46,154 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:46,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:57:46,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231 [2025-04-13 18:57:46,154 INFO L403 AbstractCegarLoop]: === Iteration 233 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:46,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:46,154 INFO L85 PathProgramCache]: Analyzing trace with hash 663896802, now seen corresponding path program 233 times [2025-04-13 18:57:46,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:46,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587204032] [2025-04-13 18:57:46,154 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:57:46,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:46,157 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:46,168 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:46,168 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:57:46,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:46,739 INFO L134 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:57:46,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:46,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587204032] [2025-04-13 18:57:46,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587204032] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:46,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:46,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:46,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197904349] [2025-04-13 18:57:46,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:46,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:46,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:46,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:46,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:46,740 INFO L87 Difference]: Start difference. First operand 10548 states and 40459 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:47,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:47,641 INFO L93 Difference]: Finished difference Result 18904 states and 69980 transitions. [2025-04-13 18:57:47,642 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:47,642 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:47,642 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:47,711 INFO L225 Difference]: With dead ends: 18904 [2025-04-13 18:57:47,712 INFO L226 Difference]: Without dead ends: 18828 [2025-04-13 18:57:47,718 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:47,718 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 294 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:47,718 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 489 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:47,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18828 states. [2025-04-13 18:57:47,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18828 to 10540. [2025-04-13 18:57:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10540 states, 10539 states have (on average 3.8363222317107883) internal successors, (40431), 10539 states have internal predecessors, (40431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:47,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10540 states to 10540 states and 40431 transitions. [2025-04-13 18:57:47,956 INFO L79 Accepts]: Start accepts. Automaton has 10540 states and 40431 transitions. Word has length 54 [2025-04-13 18:57:47,957 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:47,957 INFO L485 AbstractCegarLoop]: Abstraction has 10540 states and 40431 transitions. [2025-04-13 18:57:47,957 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:47,957 INFO L278 IsEmpty]: Start isEmpty. Operand 10540 states and 40431 transitions. [2025-04-13 18:57:47,973 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:47,973 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:47,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:57:47,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232 [2025-04-13 18:57:47,973 INFO L403 AbstractCegarLoop]: === Iteration 234 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:47,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:47,973 INFO L85 PathProgramCache]: Analyzing trace with hash 324752566, now seen corresponding path program 234 times [2025-04-13 18:57:47,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:47,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296001043] [2025-04-13 18:57:47,973 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:57:47,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:47,976 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:47,986 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:47,986 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:57:47,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:48,641 INFO L134 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:57:48,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:48,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296001043] [2025-04-13 18:57:48,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296001043] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:48,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:48,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:48,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503941227] [2025-04-13 18:57:48,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:48,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:48,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:48,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:48,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:48,642 INFO L87 Difference]: Start difference. First operand 10540 states and 40431 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:49,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:49,490 INFO L93 Difference]: Finished difference Result 19863 states and 73164 transitions. [2025-04-13 18:57:49,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:49,490 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:49,490 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:49,555 INFO L225 Difference]: With dead ends: 19863 [2025-04-13 18:57:49,555 INFO L226 Difference]: Without dead ends: 19781 [2025-04-13 18:57:49,562 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:49,562 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 302 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:49,562 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 478 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19781 states. [2025-04-13 18:57:49,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19781 to 10529. [2025-04-13 18:57:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10529 states, 10528 states have (on average 3.8367211246200608) internal successors, (40393), 10528 states have internal predecessors, (40393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10529 states to 10529 states and 40393 transitions. [2025-04-13 18:57:49,811 INFO L79 Accepts]: Start accepts. Automaton has 10529 states and 40393 transitions. Word has length 54 [2025-04-13 18:57:49,811 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:49,811 INFO L485 AbstractCegarLoop]: Abstraction has 10529 states and 40393 transitions. [2025-04-13 18:57:49,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:49,811 INFO L278 IsEmpty]: Start isEmpty. Operand 10529 states and 40393 transitions. [2025-04-13 18:57:49,827 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:49,827 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:49,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] [2025-04-13 18:57:49,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable233 [2025-04-13 18:57:49,828 INFO L403 AbstractCegarLoop]: === Iteration 235 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:49,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:49,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1017940108, now seen corresponding path program 235 times [2025-04-13 18:57:49,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:49,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922535300] [2025-04-13 18:57:49,828 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:57:49,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:49,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:49,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:49,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:57:49,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:50,487 INFO L134 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:57:50,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:50,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922535300] [2025-04-13 18:57:50,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922535300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:50,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:50,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:50,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094126542] [2025-04-13 18:57:50,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:50,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:50,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:50,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:50,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:50,488 INFO L87 Difference]: Start difference. First operand 10529 states and 40393 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:51,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:51,374 INFO L93 Difference]: Finished difference Result 18857 states and 69861 transitions. [2025-04-13 18:57:51,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:51,374 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:51,374 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:51,434 INFO L225 Difference]: With dead ends: 18857 [2025-04-13 18:57:51,435 INFO L226 Difference]: Without dead ends: 18733 [2025-04-13 18:57:51,441 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:51,441 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 278 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:51,441 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 486 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:51,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18733 states. [2025-04-13 18:57:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18733 to 10513. [2025-04-13 18:57:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10513 states, 10512 states have (on average 3.837233637747336) internal successors, (40337), 10512 states have internal predecessors, (40337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10513 states to 10513 states and 40337 transitions. [2025-04-13 18:57:51,685 INFO L79 Accepts]: Start accepts. Automaton has 10513 states and 40337 transitions. Word has length 54 [2025-04-13 18:57:51,685 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:51,685 INFO L485 AbstractCegarLoop]: Abstraction has 10513 states and 40337 transitions. [2025-04-13 18:57:51,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:51,686 INFO L278 IsEmpty]: Start isEmpty. Operand 10513 states and 40337 transitions. [2025-04-13 18:57:51,701 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:51,701 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:51,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:51,702 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2025-04-13 18:57:51,702 INFO L403 AbstractCegarLoop]: === Iteration 236 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:51,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:51,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1357084344, now seen corresponding path program 236 times [2025-04-13 18:57:51,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:51,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172148719] [2025-04-13 18:57:51,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:57:51,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:51,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:51,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:51,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:57:51,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:52,332 INFO L134 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:57:52,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:52,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172148719] [2025-04-13 18:57:52,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172148719] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:52,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:52,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237600820] [2025-04-13 18:57:52,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:52,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:52,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:52,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:52,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:52,333 INFO L87 Difference]: Start difference. First operand 10513 states and 40337 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:53,169 INFO L93 Difference]: Finished difference Result 19811 states and 73024 transitions. [2025-04-13 18:57:53,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:53,169 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:53,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:53,234 INFO L225 Difference]: With dead ends: 19811 [2025-04-13 18:57:53,235 INFO L226 Difference]: Without dead ends: 19672 [2025-04-13 18:57:53,241 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:53,241 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 281 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:53,242 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 474 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:53,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19672 states. [2025-04-13 18:57:53,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19672 to 10491. [2025-04-13 18:57:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10491 states, 10490 states have (on average 3.838322211630124) internal successors, (40264), 10490 states have internal predecessors, (40264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:53,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10491 states to 10491 states and 40264 transitions. [2025-04-13 18:57:53,499 INFO L79 Accepts]: Start accepts. Automaton has 10491 states and 40264 transitions. Word has length 54 [2025-04-13 18:57:53,499 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:53,499 INFO L485 AbstractCegarLoop]: Abstraction has 10491 states and 40264 transitions. [2025-04-13 18:57:53,499 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:53,499 INFO L278 IsEmpty]: Start isEmpty. Operand 10491 states and 40264 transitions. [2025-04-13 18:57:53,518 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:53,519 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:53,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:53,519 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235 [2025-04-13 18:57:53,519 INFO L403 AbstractCegarLoop]: === Iteration 237 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:53,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:53,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1171251452, now seen corresponding path program 237 times [2025-04-13 18:57:53,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:53,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905846298] [2025-04-13 18:57:53,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:57:53,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:53,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:53,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:53,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:57:53,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:54,086 INFO L134 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:57:54,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:54,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905846298] [2025-04-13 18:57:54,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905846298] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:54,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:54,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:54,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376591810] [2025-04-13 18:57:54,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:54,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:54,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:54,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:54,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:54,087 INFO L87 Difference]: Start difference. First operand 10491 states and 40264 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:55,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:55,004 INFO L93 Difference]: Finished difference Result 18719 states and 69432 transitions. [2025-04-13 18:57:55,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:55,004 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:55,004 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:55,069 INFO L225 Difference]: With dead ends: 18719 [2025-04-13 18:57:55,070 INFO L226 Difference]: Without dead ends: 18649 [2025-04-13 18:57:55,076 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:55,076 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 278 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:55,076 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 553 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:55,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18649 states. [2025-04-13 18:57:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18649 to 10521. [2025-04-13 18:57:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10521 states, 10520 states have (on average 3.836406844106464) internal successors, (40359), 10520 states have internal predecessors, (40359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10521 states to 10521 states and 40359 transitions. [2025-04-13 18:57:55,379 INFO L79 Accepts]: Start accepts. Automaton has 10521 states and 40359 transitions. Word has length 54 [2025-04-13 18:57:55,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:55,379 INFO L485 AbstractCegarLoop]: Abstraction has 10521 states and 40359 transitions. [2025-04-13 18:57:55,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:55,379 INFO L278 IsEmpty]: Start isEmpty. Operand 10521 states and 40359 transitions. [2025-04-13 18:57:55,396 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:55,396 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:55,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:55,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2025-04-13 18:57:55,396 INFO L403 AbstractCegarLoop]: === Iteration 238 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:55,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:55,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1610071848, now seen corresponding path program 238 times [2025-04-13 18:57:55,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:55,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404904037] [2025-04-13 18:57:55,397 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:57:55,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:55,399 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:57:55,412 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:55,412 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:57:55,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:57:55,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:55,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404904037] [2025-04-13 18:57:55,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404904037] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:55,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:55,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:55,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957650419] [2025-04-13 18:57:55,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:55,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:55,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:55,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:55,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:55,995 INFO L87 Difference]: Start difference. First operand 10521 states and 40359 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:56,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:56,838 INFO L93 Difference]: Finished difference Result 19704 states and 72711 transitions. [2025-04-13 18:57:56,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:56,838 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:56,838 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:56,904 INFO L225 Difference]: With dead ends: 19704 [2025-04-13 18:57:56,904 INFO L226 Difference]: Without dead ends: 19640 [2025-04-13 18:57:56,910 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:56,910 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 298 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:56,910 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 453 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:57:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19640 states. [2025-04-13 18:57:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19640 to 10545. [2025-04-13 18:57:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10545 states, 10544 states have (on average 3.8348823975720787) internal successors, (40435), 10544 states have internal predecessors, (40435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10545 states to 10545 states and 40435 transitions. [2025-04-13 18:57:57,166 INFO L79 Accepts]: Start accepts. Automaton has 10545 states and 40435 transitions. Word has length 54 [2025-04-13 18:57:57,166 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:57,166 INFO L485 AbstractCegarLoop]: Abstraction has 10545 states and 40435 transitions. [2025-04-13 18:57:57,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:57,167 INFO L278 IsEmpty]: Start isEmpty. Operand 10545 states and 40435 transitions. [2025-04-13 18:57:57,183 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:57,183 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:57,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:57,183 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable237 [2025-04-13 18:57:57,183 INFO L403 AbstractCegarLoop]: === Iteration 239 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:57,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:57,183 INFO L85 PathProgramCache]: Analyzing trace with hash -250675486, now seen corresponding path program 239 times [2025-04-13 18:57:57,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:57,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189102551] [2025-04-13 18:57:57,184 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:57:57,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:57,186 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:57,196 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:57,197 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:57:57,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:57,783 INFO L134 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:57:57,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:57,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189102551] [2025-04-13 18:57:57,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189102551] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:57,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:57,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:57,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018414418] [2025-04-13 18:57:57,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:57,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:57,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:57,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:57,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:57,784 INFO L87 Difference]: Start difference. First operand 10545 states and 40435 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:58,658 INFO L93 Difference]: Finished difference Result 18741 states and 69493 transitions. [2025-04-13 18:57:58,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:57:58,658 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:57:58,659 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:58,724 INFO L225 Difference]: With dead ends: 18741 [2025-04-13 18:57:58,725 INFO L226 Difference]: Without dead ends: 18663 [2025-04-13 18:57:58,731 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:57:58,731 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 295 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:58,731 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 543 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:57:58,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18663 states. [2025-04-13 18:57:58,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18663 to 10535. [2025-04-13 18:57:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10535 states, 10534 states have (on average 3.835200303778242) internal successors, (40400), 10534 states have internal predecessors, (40400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10535 states to 10535 states and 40400 transitions. [2025-04-13 18:57:58,952 INFO L79 Accepts]: Start accepts. Automaton has 10535 states and 40400 transitions. Word has length 54 [2025-04-13 18:57:58,952 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:58,952 INFO L485 AbstractCegarLoop]: Abstraction has 10535 states and 40400 transitions. [2025-04-13 18:57:58,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:58,952 INFO L278 IsEmpty]: Start isEmpty. Operand 10535 states and 40400 transitions. [2025-04-13 18:57:58,969 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:57:58,969 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:58,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:58,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable238 [2025-04-13 18:57:58,969 INFO L403 AbstractCegarLoop]: === Iteration 240 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:58,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:58,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1239324854, now seen corresponding path program 240 times [2025-04-13 18:57:58,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:58,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329863389] [2025-04-13 18:57:58,970 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:57:58,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:58,972 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:57:58,982 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:57:58,982 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:57:58,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:59,634 INFO L134 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:57:59,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:59,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329863389] [2025-04-13 18:57:59,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329863389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:59,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:59,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:57:59,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994319443] [2025-04-13 18:57:59,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:59,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:57:59,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:59,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:57:59,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:57:59,635 INFO L87 Difference]: Start difference. First operand 10535 states and 40400 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:00,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:00,515 INFO L93 Difference]: Finished difference Result 19701 states and 72687 transitions. [2025-04-13 18:58:00,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:00,515 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:00,516 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:00,577 INFO L225 Difference]: With dead ends: 19701 [2025-04-13 18:58:00,577 INFO L226 Difference]: Without dead ends: 19622 [2025-04-13 18:58:00,584 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:00,584 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 287 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:00,584 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 559 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:00,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19622 states. [2025-04-13 18:58:00,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19622 to 10527. [2025-04-13 18:58:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10527 states, 10526 states have (on average 3.8354550636519096) internal successors, (40372), 10526 states have internal predecessors, (40372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10527 states to 10527 states and 40372 transitions. [2025-04-13 18:58:00,836 INFO L79 Accepts]: Start accepts. Automaton has 10527 states and 40372 transitions. Word has length 54 [2025-04-13 18:58:00,836 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:00,836 INFO L485 AbstractCegarLoop]: Abstraction has 10527 states and 40372 transitions. [2025-04-13 18:58:00,836 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:00,836 INFO L278 IsEmpty]: Start isEmpty. Operand 10527 states and 40372 transitions. [2025-04-13 18:58:00,852 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:00,852 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:00,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] [2025-04-13 18:58:00,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2025-04-13 18:58:00,852 INFO L403 AbstractCegarLoop]: === Iteration 241 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:00,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:00,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1769714284, now seen corresponding path program 241 times [2025-04-13 18:58:00,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:00,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196373141] [2025-04-13 18:58:00,853 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:58:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:00,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:00,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:00,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:58:00,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:01,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:58:01,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:01,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196373141] [2025-04-13 18:58:01,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196373141] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:01,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:01,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:01,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742550395] [2025-04-13 18:58:01,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:01,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:01,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:01,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:01,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:01,465 INFO L87 Difference]: Start difference. First operand 10527 states and 40372 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:02,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:02,298 INFO L93 Difference]: Finished difference Result 18695 states and 69377 transitions. [2025-04-13 18:58:02,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:02,299 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:02,299 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:02,367 INFO L225 Difference]: With dead ends: 18695 [2025-04-13 18:58:02,368 INFO L226 Difference]: Without dead ends: 18559 [2025-04-13 18:58:02,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:02,376 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 282 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:02,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 466 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18559 states. [2025-04-13 18:58:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18559 to 10499. [2025-04-13 18:58:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10499 states, 10498 states have (on average 3.8373023433034863) internal successors, (40284), 10498 states have internal predecessors, (40284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10499 states to 10499 states and 40284 transitions. [2025-04-13 18:58:02,619 INFO L79 Accepts]: Start accepts. Automaton has 10499 states and 40284 transitions. Word has length 54 [2025-04-13 18:58:02,619 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:02,619 INFO L485 AbstractCegarLoop]: Abstraction has 10499 states and 40284 transitions. [2025-04-13 18:58:02,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:02,619 INFO L278 IsEmpty]: Start isEmpty. Operand 10499 states and 40284 transitions. [2025-04-13 18:58:02,635 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:02,636 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:02,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:02,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2025-04-13 18:58:02,636 INFO L403 AbstractCegarLoop]: === Iteration 242 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:02,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash -605310168, now seen corresponding path program 242 times [2025-04-13 18:58:02,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:02,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632035866] [2025-04-13 18:58:02,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:58:02,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:02,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:02,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:02,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:58:02,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:03,235 INFO L134 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:58:03,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:03,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632035866] [2025-04-13 18:58:03,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632035866] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:03,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:03,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:03,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902453993] [2025-04-13 18:58:03,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:03,236 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:03,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:03,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:03,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:03,236 INFO L87 Difference]: Start difference. First operand 10499 states and 40284 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:04,120 INFO L93 Difference]: Finished difference Result 19640 states and 72525 transitions. [2025-04-13 18:58:04,121 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:04,121 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:04,121 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:04,183 INFO L225 Difference]: With dead ends: 19640 [2025-04-13 18:58:04,183 INFO L226 Difference]: Without dead ends: 19499 [2025-04-13 18:58:04,190 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:04,190 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 271 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:04,190 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 542 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:04,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19499 states. [2025-04-13 18:58:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19499 to 10475. [2025-04-13 18:58:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10475 states, 10474 states have (on average 3.8388390299789954) internal successors, (40208), 10474 states have internal predecessors, (40208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:04,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10475 states to 10475 states and 40208 transitions. [2025-04-13 18:58:04,496 INFO L79 Accepts]: Start accepts. Automaton has 10475 states and 40208 transitions. Word has length 54 [2025-04-13 18:58:04,496 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:04,496 INFO L485 AbstractCegarLoop]: Abstraction has 10475 states and 40208 transitions. [2025-04-13 18:58:04,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:04,496 INFO L278 IsEmpty]: Start isEmpty. Operand 10475 states and 40208 transitions. [2025-04-13 18:58:04,512 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:04,512 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:04,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:04,512 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2025-04-13 18:58:04,512 INFO L403 AbstractCegarLoop]: === Iteration 243 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:04,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:04,513 INFO L85 PathProgramCache]: Analyzing trace with hash 120460052, now seen corresponding path program 243 times [2025-04-13 18:58:04,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:04,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025539637] [2025-04-13 18:58:04,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:58:04,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:04,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:04,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:04,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:58:04,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:05,091 INFO L134 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:58:05,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:05,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025539637] [2025-04-13 18:58:05,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025539637] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:05,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:05,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:05,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116357029] [2025-04-13 18:58:05,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:05,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:05,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:05,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:05,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:05,092 INFO L87 Difference]: Start difference. First operand 10475 states and 40208 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:06,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:06,046 INFO L93 Difference]: Finished difference Result 18559 states and 68961 transitions. [2025-04-13 18:58:06,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:06,046 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:06,046 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:06,110 INFO L225 Difference]: With dead ends: 18559 [2025-04-13 18:58:06,111 INFO L226 Difference]: Without dead ends: 18447 [2025-04-13 18:58:06,116 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:06,116 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 268 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:06,116 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 501 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:06,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18447 states. [2025-04-13 18:58:06,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18447 to 10563. [2025-04-13 18:58:06,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10563 states, 10562 states have (on average 3.832986176860443) internal successors, (40484), 10562 states have internal predecessors, (40484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10563 states to 10563 states and 40484 transitions. [2025-04-13 18:58:06,358 INFO L79 Accepts]: Start accepts. Automaton has 10563 states and 40484 transitions. Word has length 54 [2025-04-13 18:58:06,358 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:06,358 INFO L485 AbstractCegarLoop]: Abstraction has 10563 states and 40484 transitions. [2025-04-13 18:58:06,358 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:06,358 INFO L278 IsEmpty]: Start isEmpty. Operand 10563 states and 40484 transitions. [2025-04-13 18:58:06,374 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:06,374 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:06,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] [2025-04-13 18:58:06,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2025-04-13 18:58:06,374 INFO L403 AbstractCegarLoop]: === Iteration 244 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:06,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:06,374 INFO L85 PathProgramCache]: Analyzing trace with hash 415957160, now seen corresponding path program 244 times [2025-04-13 18:58:06,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:06,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867370731] [2025-04-13 18:58:06,374 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:58:06,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:06,377 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:58:06,388 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:06,388 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:58:06,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:06,950 INFO L134 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:58:06,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:06,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867370731] [2025-04-13 18:58:06,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867370731] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:06,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:06,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:06,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742966525] [2025-04-13 18:58:06,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:06,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:06,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:06,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:06,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:06,951 INFO L87 Difference]: Start difference. First operand 10563 states and 40484 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:07,841 INFO L93 Difference]: Finished difference Result 19611 states and 72455 transitions. [2025-04-13 18:58:07,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:07,842 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:07,842 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:07,907 INFO L225 Difference]: With dead ends: 19611 [2025-04-13 18:58:07,907 INFO L226 Difference]: Without dead ends: 19475 [2025-04-13 18:58:07,914 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:07,914 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 272 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:07,914 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 505 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19475 states. [2025-04-13 18:58:08,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19475 to 10684. [2025-04-13 18:58:08,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10684 states, 10683 states have (on average 3.8245811101750444) internal successors, (40858), 10683 states have internal predecessors, (40858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10684 states to 10684 states and 40858 transitions. [2025-04-13 18:58:08,165 INFO L79 Accepts]: Start accepts. Automaton has 10684 states and 40858 transitions. Word has length 54 [2025-04-13 18:58:08,165 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:08,165 INFO L485 AbstractCegarLoop]: Abstraction has 10684 states and 40858 transitions. [2025-04-13 18:58:08,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:08,165 INFO L278 IsEmpty]: Start isEmpty. Operand 10684 states and 40858 transitions. [2025-04-13 18:58:08,181 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:08,181 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:08,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:58:08,182 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable243 [2025-04-13 18:58:08,182 INFO L403 AbstractCegarLoop]: === Iteration 245 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:08,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:08,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1585008842, now seen corresponding path program 245 times [2025-04-13 18:58:08,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:08,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440759274] [2025-04-13 18:58:08,182 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:58:08,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:08,184 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:08,195 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:08,196 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:58:08,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:08,809 INFO L134 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:58:08,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:08,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440759274] [2025-04-13 18:58:08,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440759274] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:08,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:08,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:08,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523863996] [2025-04-13 18:58:08,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:08,810 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:08,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:08,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:08,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:08,810 INFO L87 Difference]: Start difference. First operand 10684 states and 40858 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:09,707 INFO L93 Difference]: Finished difference Result 18708 states and 69368 transitions. [2025-04-13 18:58:09,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:09,708 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:09,708 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:09,770 INFO L225 Difference]: With dead ends: 18708 [2025-04-13 18:58:09,770 INFO L226 Difference]: Without dead ends: 18644 [2025-04-13 18:58:09,776 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:09,776 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 302 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:09,776 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 505 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:09,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18644 states. [2025-04-13 18:58:09,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18644 to 10692. [2025-04-13 18:58:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10692 states, 10691 states have (on average 3.8235899354597325) internal successors, (40878), 10691 states have internal predecessors, (40878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10692 states to 10692 states and 40878 transitions. [2025-04-13 18:58:10,022 INFO L79 Accepts]: Start accepts. Automaton has 10692 states and 40878 transitions. Word has length 54 [2025-04-13 18:58:10,022 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:10,022 INFO L485 AbstractCegarLoop]: Abstraction has 10692 states and 40878 transitions. [2025-04-13 18:58:10,022 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:10,022 INFO L278 IsEmpty]: Start isEmpty. Operand 10692 states and 40878 transitions. [2025-04-13 18:58:10,039 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:10,039 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:10,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:10,039 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2025-04-13 18:58:10,039 INFO L403 AbstractCegarLoop]: === Iteration 246 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:10,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:10,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1289511734, now seen corresponding path program 246 times [2025-04-13 18:58:10,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:10,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560259156] [2025-04-13 18:58:10,039 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:58:10,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:10,042 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:10,052 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:10,052 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:58:10,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:58:10,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:10,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560259156] [2025-04-13 18:58:10,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560259156] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:10,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:10,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:10,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984614878] [2025-04-13 18:58:10,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:10,663 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:10,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:10,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:10,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:10,664 INFO L87 Difference]: Start difference. First operand 10692 states and 40878 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:11,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:11,602 INFO L93 Difference]: Finished difference Result 19635 states and 72465 transitions. [2025-04-13 18:58:11,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:11,602 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:11,602 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:11,673 INFO L225 Difference]: With dead ends: 19635 [2025-04-13 18:58:11,673 INFO L226 Difference]: Without dead ends: 19565 [2025-04-13 18:58:11,680 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:11,681 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 282 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:11,681 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 506 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:11,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19565 states. [2025-04-13 18:58:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19565 to 10703. [2025-04-13 18:58:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10703 states, 10702 states have (on average 3.82218276957578) internal successors, (40905), 10702 states have internal predecessors, (40905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10703 states to 10703 states and 40905 transitions. [2025-04-13 18:58:11,933 INFO L79 Accepts]: Start accepts. Automaton has 10703 states and 40905 transitions. Word has length 54 [2025-04-13 18:58:11,933 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:11,933 INFO L485 AbstractCegarLoop]: Abstraction has 10703 states and 40905 transitions. [2025-04-13 18:58:11,934 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:11,934 INFO L278 IsEmpty]: Start isEmpty. Operand 10703 states and 40905 transitions. [2025-04-13 18:58:11,950 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:11,950 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:11,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:11,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable245 [2025-04-13 18:58:11,950 INFO L403 AbstractCegarLoop]: === Iteration 247 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:11,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:11,951 INFO L85 PathProgramCache]: Analyzing trace with hash 299977492, now seen corresponding path program 247 times [2025-04-13 18:58:11,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:11,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387967120] [2025-04-13 18:58:11,951 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:58:11,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:11,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:11,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:11,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:58:11,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:12,538 INFO L134 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:58:12,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:12,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387967120] [2025-04-13 18:58:12,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387967120] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:12,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:12,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:12,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180598630] [2025-04-13 18:58:12,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:12,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:12,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:12,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:12,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:12,539 INFO L87 Difference]: Start difference. First operand 10703 states and 40905 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:13,466 INFO L93 Difference]: Finished difference Result 18655 states and 69226 transitions. [2025-04-13 18:58:13,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:13,466 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:13,466 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:13,534 INFO L225 Difference]: With dead ends: 18655 [2025-04-13 18:58:13,535 INFO L226 Difference]: Without dead ends: 18555 [2025-04-13 18:58:13,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:13,542 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 262 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:13,542 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 521 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18555 states. [2025-04-13 18:58:13,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18555 to 10671. [2025-04-13 18:58:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10671 states, 10670 states have (on average 3.8238987816307404) internal successors, (40801), 10670 states have internal predecessors, (40801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:13,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10671 states to 10671 states and 40801 transitions. [2025-04-13 18:58:13,844 INFO L79 Accepts]: Start accepts. Automaton has 10671 states and 40801 transitions. Word has length 54 [2025-04-13 18:58:13,844 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:13,844 INFO L485 AbstractCegarLoop]: Abstraction has 10671 states and 40801 transitions. [2025-04-13 18:58:13,844 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:13,844 INFO L278 IsEmpty]: Start isEmpty. Operand 10671 states and 40801 transitions. [2025-04-13 18:58:13,860 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:13,861 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:13,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:58:13,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2025-04-13 18:58:13,861 INFO L403 AbstractCegarLoop]: === Iteration 248 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:13,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:13,861 INFO L85 PathProgramCache]: Analyzing trace with hash 595474600, now seen corresponding path program 248 times [2025-04-13 18:58:13,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:13,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235598384] [2025-04-13 18:58:13,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:58:13,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:13,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:13,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:13,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:58:13,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:14,471 INFO L134 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:58:14,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:14,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235598384] [2025-04-13 18:58:14,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235598384] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:14,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:14,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:14,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196747537] [2025-04-13 18:58:14,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:14,472 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:14,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:14,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:14,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:14,472 INFO L87 Difference]: Start difference. First operand 10671 states and 40801 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:15,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:15,355 INFO L93 Difference]: Finished difference Result 19533 states and 72172 transitions. [2025-04-13 18:58:15,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:15,355 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:15,355 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:15,422 INFO L225 Difference]: With dead ends: 19533 [2025-04-13 18:58:15,422 INFO L226 Difference]: Without dead ends: 19418 [2025-04-13 18:58:15,428 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:15,429 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 273 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:15,429 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 494 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:15,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19418 states. [2025-04-13 18:58:15,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19418 to 10627. [2025-04-13 18:58:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10627 states, 10626 states have (on average 3.826463391680783) internal successors, (40660), 10626 states have internal predecessors, (40660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:15,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10627 states to 10627 states and 40660 transitions. [2025-04-13 18:58:15,676 INFO L79 Accepts]: Start accepts. Automaton has 10627 states and 40660 transitions. Word has length 54 [2025-04-13 18:58:15,676 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:15,676 INFO L485 AbstractCegarLoop]: Abstraction has 10627 states and 40660 transitions. [2025-04-13 18:58:15,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:15,676 INFO L278 IsEmpty]: Start isEmpty. Operand 10627 states and 40660 transitions. [2025-04-13 18:58:15,692 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:15,692 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:15,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:15,692 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable247 [2025-04-13 18:58:15,692 INFO L403 AbstractCegarLoop]: === Iteration 249 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:15,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:15,692 INFO L85 PathProgramCache]: Analyzing trace with hash 186587718, now seen corresponding path program 249 times [2025-04-13 18:58:15,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:15,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537493688] [2025-04-13 18:58:15,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:58:15,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:15,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:15,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:15,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:58:15,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:16,314 INFO L134 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:58:16,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:16,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537493688] [2025-04-13 18:58:16,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537493688] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:16,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:16,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:16,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858646279] [2025-04-13 18:58:16,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:16,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:16,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:16,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:16,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:16,315 INFO L87 Difference]: Start difference. First operand 10627 states and 40660 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:17,228 INFO L93 Difference]: Finished difference Result 18599 states and 69041 transitions. [2025-04-13 18:58:17,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:17,228 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:17,228 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:17,287 INFO L225 Difference]: With dead ends: 18599 [2025-04-13 18:58:17,287 INFO L226 Difference]: Without dead ends: 18535 [2025-04-13 18:58:17,293 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:17,293 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 276 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:17,293 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 464 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18535 states. [2025-04-13 18:58:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18535 to 10651. [2025-04-13 18:58:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10651 states, 10650 states have (on average 3.8249765258215964) internal successors, (40736), 10650 states have internal predecessors, (40736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10651 states to 10651 states and 40736 transitions. [2025-04-13 18:58:17,518 INFO L79 Accepts]: Start accepts. Automaton has 10651 states and 40736 transitions. Word has length 54 [2025-04-13 18:58:17,518 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:17,518 INFO L485 AbstractCegarLoop]: Abstraction has 10651 states and 40736 transitions. [2025-04-13 18:58:17,518 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:17,518 INFO L278 IsEmpty]: Start isEmpty. Operand 10651 states and 40736 transitions. [2025-04-13 18:58:17,534 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:17,534 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:17,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:17,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable248 [2025-04-13 18:58:17,534 INFO L403 AbstractCegarLoop]: === Iteration 250 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:17,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:17,535 INFO L85 PathProgramCache]: Analyzing trace with hash 482084826, now seen corresponding path program 250 times [2025-04-13 18:58:17,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:17,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767779935] [2025-04-13 18:58:17,535 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:58:17,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:17,537 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:58:17,549 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:17,549 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:58:17,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:18,198 INFO L134 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:58:18,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:18,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767779935] [2025-04-13 18:58:18,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767779935] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:18,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:18,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:18,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073930000] [2025-04-13 18:58:18,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:18,199 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:18,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:18,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:18,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:18,199 INFO L87 Difference]: Start difference. First operand 10651 states and 40736 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:19,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:19,124 INFO L93 Difference]: Finished difference Result 19536 states and 72174 transitions. [2025-04-13 18:58:19,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:19,125 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:19,125 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:19,188 INFO L225 Difference]: With dead ends: 19536 [2025-04-13 18:58:19,188 INFO L226 Difference]: Without dead ends: 19466 [2025-04-13 18:58:19,195 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:19,195 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 276 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:19,195 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 509 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:19,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19466 states. [2025-04-13 18:58:19,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19466 to 10684. [2025-04-13 18:58:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10684 states, 10683 states have (on average 3.8228025835439485) internal successors, (40839), 10683 states have internal predecessors, (40839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10684 states to 10684 states and 40839 transitions. [2025-04-13 18:58:19,437 INFO L79 Accepts]: Start accepts. Automaton has 10684 states and 40839 transitions. Word has length 54 [2025-04-13 18:58:19,437 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:19,438 INFO L485 AbstractCegarLoop]: Abstraction has 10684 states and 40839 transitions. [2025-04-13 18:58:19,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:19,438 INFO L278 IsEmpty]: Start isEmpty. Operand 10684 states and 40839 transitions. [2025-04-13 18:58:19,455 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:19,455 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:19,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] [2025-04-13 18:58:19,455 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249 [2025-04-13 18:58:19,455 INFO L403 AbstractCegarLoop]: === Iteration 251 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:19,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:19,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2071574052, now seen corresponding path program 251 times [2025-04-13 18:58:19,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:19,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979217132] [2025-04-13 18:58:19,456 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:58:19,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:19,458 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:19,470 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:19,470 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:58:19,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:20,048 INFO L134 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:58:20,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:20,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979217132] [2025-04-13 18:58:20,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979217132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:20,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:20,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:20,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701989562] [2025-04-13 18:58:20,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:20,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:20,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:20,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:20,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:20,048 INFO L87 Difference]: Start difference. First operand 10684 states and 40839 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:21,010 INFO L93 Difference]: Finished difference Result 18636 states and 69148 transitions. [2025-04-13 18:58:21,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:21,010 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:21,010 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:21,071 INFO L225 Difference]: With dead ends: 18636 [2025-04-13 18:58:21,072 INFO L226 Difference]: Without dead ends: 18560 [2025-04-13 18:58:21,077 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:21,077 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 278 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:21,078 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 482 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18560 states. [2025-04-13 18:58:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18560 to 10676. [2025-04-13 18:58:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10676 states, 10675 states have (on average 3.8230444964871193) internal successors, (40811), 10675 states have internal predecessors, (40811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10676 states to 10676 states and 40811 transitions. [2025-04-13 18:58:21,316 INFO L79 Accepts]: Start accepts. Automaton has 10676 states and 40811 transitions. Word has length 54 [2025-04-13 18:58:21,317 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:21,317 INFO L485 AbstractCegarLoop]: Abstraction has 10676 states and 40811 transitions. [2025-04-13 18:58:21,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:21,317 INFO L278 IsEmpty]: Start isEmpty. Operand 10676 states and 40811 transitions. [2025-04-13 18:58:21,333 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:21,333 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:21,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:21,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250 [2025-04-13 18:58:21,333 INFO L403 AbstractCegarLoop]: === Iteration 252 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:21,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:21,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1927896136, now seen corresponding path program 252 times [2025-04-13 18:58:21,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:21,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898717044] [2025-04-13 18:58:21,334 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:58:21,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:21,336 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:21,346 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:21,346 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:58:21,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:21,977 INFO L134 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:58:21,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:21,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898717044] [2025-04-13 18:58:21,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898717044] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:21,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:21,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:21,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942234104] [2025-04-13 18:58:21,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:21,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:21,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:21,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:21,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:21,978 INFO L87 Difference]: Start difference. First operand 10676 states and 40811 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:22,860 INFO L93 Difference]: Finished difference Result 19529 states and 72137 transitions. [2025-04-13 18:58:22,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:22,860 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:22,860 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:22,926 INFO L225 Difference]: With dead ends: 19529 [2025-04-13 18:58:22,926 INFO L226 Difference]: Without dead ends: 19447 [2025-04-13 18:58:22,931 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:22,931 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 278 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:22,931 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 439 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:58:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19447 states. [2025-04-13 18:58:23,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19447 to 10665. [2025-04-13 18:58:23,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10665 states, 10664 states have (on average 3.823424606151538) internal successors, (40773), 10664 states have internal predecessors, (40773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10665 states to 10665 states and 40773 transitions. [2025-04-13 18:58:23,165 INFO L79 Accepts]: Start accepts. Automaton has 10665 states and 40773 transitions. Word has length 54 [2025-04-13 18:58:23,165 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:23,165 INFO L485 AbstractCegarLoop]: Abstraction has 10665 states and 40773 transitions. [2025-04-13 18:58:23,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:23,165 INFO L278 IsEmpty]: Start isEmpty. Operand 10665 states and 40773 transitions. [2025-04-13 18:58:23,181 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:23,181 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:23,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:58:23,182 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251 [2025-04-13 18:58:23,182 INFO L403 AbstractCegarLoop]: === Iteration 253 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:23,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:23,182 INFO L85 PathProgramCache]: Analyzing trace with hash 389737142, now seen corresponding path program 253 times [2025-04-13 18:58:23,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:23,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240918694] [2025-04-13 18:58:23,182 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:58:23,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:23,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:23,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:23,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:58:23,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:23,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:58:23,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:23,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240918694] [2025-04-13 18:58:23,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240918694] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:23,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:23,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:23,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33100845] [2025-04-13 18:58:23,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:23,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:23,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:23,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:23,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:23,758 INFO L87 Difference]: Start difference. First operand 10665 states and 40773 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:24,623 INFO L93 Difference]: Finished difference Result 18549 states and 68909 transitions. [2025-04-13 18:58:24,623 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:24,623 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:24,623 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:24,687 INFO L225 Difference]: With dead ends: 18549 [2025-04-13 18:58:24,687 INFO L226 Difference]: Without dead ends: 18161 [2025-04-13 18:58:24,693 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:24,693 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 262 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:24,693 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 438 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:58:24,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18161 states. [2025-04-13 18:58:24,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18161 to 10385. [2025-04-13 18:58:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10385 states, 10384 states have (on average 3.8379237288135593) internal successors, (39853), 10384 states have internal predecessors, (39853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10385 states to 10385 states and 39853 transitions. [2025-04-13 18:58:24,928 INFO L79 Accepts]: Start accepts. Automaton has 10385 states and 39853 transitions. Word has length 54 [2025-04-13 18:58:24,928 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:24,928 INFO L485 AbstractCegarLoop]: Abstraction has 10385 states and 39853 transitions. [2025-04-13 18:58:24,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:24,928 INFO L278 IsEmpty]: Start isEmpty. Operand 10385 states and 39853 transitions. [2025-04-13 18:58:24,944 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:24,944 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:24,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:24,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252 [2025-04-13 18:58:24,944 INFO L403 AbstractCegarLoop]: === Iteration 254 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:24,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:24,945 INFO L85 PathProgramCache]: Analyzing trace with hash 685234250, now seen corresponding path program 254 times [2025-04-13 18:58:24,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:24,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822513033] [2025-04-13 18:58:24,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:58:24,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:24,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:24,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:24,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:58:24,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:25,567 INFO L134 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:58:25,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:25,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822513033] [2025-04-13 18:58:25,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822513033] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:25,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:25,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:25,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740529482] [2025-04-13 18:58:25,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:25,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:25,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:25,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:25,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:25,568 INFO L87 Difference]: Start difference. First operand 10385 states and 39853 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:26,408 INFO L93 Difference]: Finished difference Result 19167 states and 70999 transitions. [2025-04-13 18:58:26,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:26,408 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:26,408 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:26,469 INFO L225 Difference]: With dead ends: 19167 [2025-04-13 18:58:26,469 INFO L226 Difference]: Without dead ends: 18716 [2025-04-13 18:58:26,476 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=369, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:26,476 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 245 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:26,476 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 495 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:26,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18716 states. [2025-04-13 18:58:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18716 to 10051. [2025-04-13 18:58:26,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10051 states, 10050 states have (on average 3.857910447761194) internal successors, (38772), 10050 states have internal predecessors, (38772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10051 states to 10051 states and 38772 transitions. [2025-04-13 18:58:26,710 INFO L79 Accepts]: Start accepts. Automaton has 10051 states and 38772 transitions. Word has length 54 [2025-04-13 18:58:26,710 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:26,710 INFO L485 AbstractCegarLoop]: Abstraction has 10051 states and 38772 transitions. [2025-04-13 18:58:26,710 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:26,710 INFO L278 IsEmpty]: Start isEmpty. Operand 10051 states and 38772 transitions. [2025-04-13 18:58:26,725 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:26,726 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:26,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:26,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253 [2025-04-13 18:58:26,726 INFO L403 AbstractCegarLoop]: === Iteration 255 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:26,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:26,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2077341116, now seen corresponding path program 255 times [2025-04-13 18:58:26,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:26,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513408879] [2025-04-13 18:58:26,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:58:26,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:26,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:26,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:26,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:58:26,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:27,335 INFO L134 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:58:27,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:27,336 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513408879] [2025-04-13 18:58:27,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513408879] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:27,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:27,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:27,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081208787] [2025-04-13 18:58:27,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:27,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:27,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:27,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:27,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:27,336 INFO L87 Difference]: Start difference. First operand 10051 states and 38772 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:28,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:28,219 INFO L93 Difference]: Finished difference Result 19230 states and 71111 transitions. [2025-04-13 18:58:28,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:28,219 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:28,219 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:28,282 INFO L225 Difference]: With dead ends: 19230 [2025-04-13 18:58:28,282 INFO L226 Difference]: Without dead ends: 19118 [2025-04-13 18:58:28,288 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:28,289 INFO L437 NwaCegarLoop]: 119 mSDtfsCounter, 328 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:28,289 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 589 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19118 states. [2025-04-13 18:58:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19118 to 10223. [2025-04-13 18:58:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10223 states, 10222 states have (on average 3.8469966738407355) internal successors, (39324), 10222 states have internal predecessors, (39324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10223 states to 10223 states and 39324 transitions. [2025-04-13 18:58:28,530 INFO L79 Accepts]: Start accepts. Automaton has 10223 states and 39324 transitions. Word has length 54 [2025-04-13 18:58:28,530 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:28,530 INFO L485 AbstractCegarLoop]: Abstraction has 10223 states and 39324 transitions. [2025-04-13 18:58:28,530 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:28,530 INFO L278 IsEmpty]: Start isEmpty. Operand 10223 states and 39324 transitions. [2025-04-13 18:58:28,546 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:28,546 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:28,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] [2025-04-13 18:58:28,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable254 [2025-04-13 18:58:28,546 INFO L403 AbstractCegarLoop]: === Iteration 256 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:28,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash -91437168, now seen corresponding path program 256 times [2025-04-13 18:58:28,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:28,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810998398] [2025-04-13 18:58:28,547 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:58:28,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:28,550 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:58:28,559 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:28,559 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:58:28,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:58:29,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:29,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810998398] [2025-04-13 18:58:29,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810998398] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:29,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:29,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:29,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893262866] [2025-04-13 18:58:29,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:29,220 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:29,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:29,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:29,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:29,221 INFO L87 Difference]: Start difference. First operand 10223 states and 39324 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:30,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:30,126 INFO L93 Difference]: Finished difference Result 20719 states and 75940 transitions. [2025-04-13 18:58:30,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:30,127 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:30,127 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:30,194 INFO L225 Difference]: With dead ends: 20719 [2025-04-13 18:58:30,194 INFO L226 Difference]: Without dead ends: 20583 [2025-04-13 18:58:30,201 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:30,202 INFO L437 NwaCegarLoop]: 119 mSDtfsCounter, 361 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:30,202 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 585 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20583 states. [2025-04-13 18:58:30,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20583 to 10474. [2025-04-13 18:58:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10474 states, 10473 states have (on average 3.8291797956650435) internal successors, (40103), 10473 states have internal predecessors, (40103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10474 states to 10474 states and 40103 transitions. [2025-04-13 18:58:30,457 INFO L79 Accepts]: Start accepts. Automaton has 10474 states and 40103 transitions. Word has length 54 [2025-04-13 18:58:30,457 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:30,457 INFO L485 AbstractCegarLoop]: Abstraction has 10474 states and 40103 transitions. [2025-04-13 18:58:30,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:30,457 INFO L278 IsEmpty]: Start isEmpty. Operand 10474 states and 40103 transitions. [2025-04-13 18:58:30,473 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:30,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:30,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:30,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable255 [2025-04-13 18:58:30,474 INFO L403 AbstractCegarLoop]: === Iteration 257 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:30,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:30,474 INFO L85 PathProgramCache]: Analyzing trace with hash -109288004, now seen corresponding path program 257 times [2025-04-13 18:58:30,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:30,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654620527] [2025-04-13 18:58:30,474 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:58:30,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:30,477 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:30,487 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:30,487 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:58:30,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:31,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:58:31,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:31,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654620527] [2025-04-13 18:58:31,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654620527] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:31,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:31,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:31,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718532501] [2025-04-13 18:58:31,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:31,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:31,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:31,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:31,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:31,068 INFO L87 Difference]: Start difference. First operand 10474 states and 40103 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:32,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:32,091 INFO L93 Difference]: Finished difference Result 19509 states and 71923 transitions. [2025-04-13 18:58:32,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:58:32,091 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:32,091 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:32,157 INFO L225 Difference]: With dead ends: 19509 [2025-04-13 18:58:32,157 INFO L226 Difference]: Without dead ends: 19445 [2025-04-13 18:58:32,161 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:32,161 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 322 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:32,161 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 634 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19445 states. [2025-04-13 18:58:32,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19445 to 10482. [2025-04-13 18:58:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10482 states, 10481 states have (on average 3.8281652514073086) internal successors, (40123), 10481 states have internal predecessors, (40123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10482 states to 10482 states and 40123 transitions. [2025-04-13 18:58:32,406 INFO L79 Accepts]: Start accepts. Automaton has 10482 states and 40123 transitions. Word has length 54 [2025-04-13 18:58:32,406 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:32,407 INFO L485 AbstractCegarLoop]: Abstraction has 10482 states and 40123 transitions. [2025-04-13 18:58:32,407 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:32,407 INFO L278 IsEmpty]: Start isEmpty. Operand 10482 states and 40123 transitions. [2025-04-13 18:58:32,422 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:32,423 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:32,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] [2025-04-13 18:58:32,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2025-04-13 18:58:32,423 INFO L403 AbstractCegarLoop]: === Iteration 258 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:32,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:32,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2016901008, now seen corresponding path program 258 times [2025-04-13 18:58:32,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:32,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290878937] [2025-04-13 18:58:32,423 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:58:32,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:32,426 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:32,435 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:32,435 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:58:32,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:58:33,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:33,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290878937] [2025-04-13 18:58:33,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290878937] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:33,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:33,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:33,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227257079] [2025-04-13 18:58:33,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:33,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:33,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:33,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:33,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:33,100 INFO L87 Difference]: Start difference. First operand 10482 states and 40123 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:34,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:34,084 INFO L93 Difference]: Finished difference Result 20743 states and 75950 transitions. [2025-04-13 18:58:34,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:34,084 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:34,084 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:34,151 INFO L225 Difference]: With dead ends: 20743 [2025-04-13 18:58:34,151 INFO L226 Difference]: Without dead ends: 20673 [2025-04-13 18:58:34,157 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:34,157 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 361 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:34,157 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 593 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:58:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20673 states. [2025-04-13 18:58:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20673 to 10493. [2025-04-13 18:58:34,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10493 states, 10492 states have (on average 3.826725123903927) internal successors, (40150), 10492 states have internal predecessors, (40150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10493 states to 10493 states and 40150 transitions. [2025-04-13 18:58:34,480 INFO L79 Accepts]: Start accepts. Automaton has 10493 states and 40150 transitions. Word has length 54 [2025-04-13 18:58:34,480 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:34,480 INFO L485 AbstractCegarLoop]: Abstraction has 10493 states and 40150 transitions. [2025-04-13 18:58:34,480 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:34,480 INFO L278 IsEmpty]: Start isEmpty. Operand 10493 states and 40150 transitions. [2025-04-13 18:58:34,495 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:34,495 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:34,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:34,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable257 [2025-04-13 18:58:34,496 INFO L403 AbstractCegarLoop]: === Iteration 259 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:34,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:34,496 INFO L85 PathProgramCache]: Analyzing trace with hash -879765986, now seen corresponding path program 259 times [2025-04-13 18:58:34,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:34,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103688738] [2025-04-13 18:58:34,496 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:58:34,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:34,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:34,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:34,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:58:34,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:35,080 INFO L134 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:58:35,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:35,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103688738] [2025-04-13 18:58:35,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103688738] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:35,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:35,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:35,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883921187] [2025-04-13 18:58:35,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:35,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:35,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:35,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:35,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:35,081 INFO L87 Difference]: Start difference. First operand 10493 states and 40150 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:36,054 INFO L93 Difference]: Finished difference Result 19456 states and 71781 transitions. [2025-04-13 18:58:36,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:36,054 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:36,054 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:36,124 INFO L225 Difference]: With dead ends: 19456 [2025-04-13 18:58:36,124 INFO L226 Difference]: Without dead ends: 19356 [2025-04-13 18:58:36,131 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:36,131 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 299 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 1541 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:36,131 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 616 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1541 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:58:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19356 states. [2025-04-13 18:58:36,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19356 to 10461. [2025-04-13 18:58:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10461 states, 10460 states have (on average 3.82848948374761) internal successors, (40046), 10460 states have internal predecessors, (40046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10461 states to 10461 states and 40046 transitions. [2025-04-13 18:58:36,381 INFO L79 Accepts]: Start accepts. Automaton has 10461 states and 40046 transitions. Word has length 54 [2025-04-13 18:58:36,381 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:36,381 INFO L485 AbstractCegarLoop]: Abstraction has 10461 states and 40046 transitions. [2025-04-13 18:58:36,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:36,382 INFO L278 IsEmpty]: Start isEmpty. Operand 10461 states and 40046 transitions. [2025-04-13 18:58:36,397 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:36,397 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:36,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:36,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258 [2025-04-13 18:58:36,397 INFO L403 AbstractCegarLoop]: === Iteration 260 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:36,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:36,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1246423026, now seen corresponding path program 260 times [2025-04-13 18:58:36,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:36,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391162835] [2025-04-13 18:58:36,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:58:36,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:36,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:36,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:36,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:58:36,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:37,007 INFO L134 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:58:37,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:37,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391162835] [2025-04-13 18:58:37,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391162835] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:37,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:37,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:37,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464027745] [2025-04-13 18:58:37,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:37,008 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:37,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:37,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:37,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:37,008 INFO L87 Difference]: Start difference. First operand 10461 states and 40046 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:37,918 INFO L93 Difference]: Finished difference Result 20641 states and 75657 transitions. [2025-04-13 18:58:37,918 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:37,918 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:37,918 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:37,984 INFO L225 Difference]: With dead ends: 20641 [2025-04-13 18:58:37,985 INFO L226 Difference]: Without dead ends: 20526 [2025-04-13 18:58:37,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:37,992 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 343 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:37,992 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 576 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:38,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20526 states. [2025-04-13 18:58:38,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20526 to 10417. [2025-04-13 18:58:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10417 states, 10416 states have (on average 3.831125192012289) internal successors, (39905), 10416 states have internal predecessors, (39905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10417 states to 10417 states and 39905 transitions. [2025-04-13 18:58:38,240 INFO L79 Accepts]: Start accepts. Automaton has 10417 states and 39905 transitions. Word has length 54 [2025-04-13 18:58:38,241 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:38,241 INFO L485 AbstractCegarLoop]: Abstraction has 10417 states and 39905 transitions. [2025-04-13 18:58:38,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:38,241 INFO L278 IsEmpty]: Start isEmpty. Operand 10417 states and 39905 transitions. [2025-04-13 18:58:38,256 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:38,256 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:38,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:58:38,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable259 [2025-04-13 18:58:38,257 INFO L403 AbstractCegarLoop]: === Iteration 261 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:38,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:38,257 INFO L85 PathProgramCache]: Analyzing trace with hash -345124578, now seen corresponding path program 261 times [2025-04-13 18:58:38,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:38,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288649712] [2025-04-13 18:58:38,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:58:38,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:38,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:38,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:38,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:58:38,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:38,860 INFO L134 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:58:38,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:38,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288649712] [2025-04-13 18:58:38,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288649712] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:38,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:38,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:38,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646288998] [2025-04-13 18:58:38,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:38,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:38,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:38,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:38,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:38,861 INFO L87 Difference]: Start difference. First operand 10417 states and 39905 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:39,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:39,745 INFO L93 Difference]: Finished difference Result 19464 states and 71788 transitions. [2025-04-13 18:58:39,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:58:39,745 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:39,745 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:39,807 INFO L225 Difference]: With dead ends: 19464 [2025-04-13 18:58:39,807 INFO L226 Difference]: Without dead ends: 19400 [2025-04-13 18:58:39,814 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=438, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:58:39,814 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 321 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:39,814 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 541 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19400 states. [2025-04-13 18:58:39,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19400 to 10441. [2025-04-13 18:58:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10441 states, 10440 states have (on average 3.8295977011494253) internal successors, (39981), 10440 states have internal predecessors, (39981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10441 states to 10441 states and 39981 transitions. [2025-04-13 18:58:40,065 INFO L79 Accepts]: Start accepts. Automaton has 10441 states and 39981 transitions. Word has length 54 [2025-04-13 18:58:40,066 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:40,066 INFO L485 AbstractCegarLoop]: Abstraction has 10441 states and 39981 transitions. [2025-04-13 18:58:40,066 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:40,066 INFO L278 IsEmpty]: Start isEmpty. Operand 10441 states and 39981 transitions. [2025-04-13 18:58:40,082 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:40,082 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:40,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:40,082 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260 [2025-04-13 18:58:40,082 INFO L403 AbstractCegarLoop]: === Iteration 262 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:40,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:40,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1781064434, now seen corresponding path program 262 times [2025-04-13 18:58:40,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:40,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434959818] [2025-04-13 18:58:40,082 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:58:40,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:40,085 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:58:40,097 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:40,097 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:58:40,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:40,696 INFO L134 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:58:40,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:40,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434959818] [2025-04-13 18:58:40,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434959818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:40,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:40,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:40,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678992170] [2025-04-13 18:58:40,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:40,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:40,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:40,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:40,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:40,697 INFO L87 Difference]: Start difference. First operand 10441 states and 39981 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:41,712 INFO L93 Difference]: Finished difference Result 20732 states and 75919 transitions. [2025-04-13 18:58:41,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:58:41,712 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:41,712 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:41,778 INFO L225 Difference]: With dead ends: 20732 [2025-04-13 18:58:41,778 INFO L226 Difference]: Without dead ends: 20662 [2025-04-13 18:58:41,786 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:58:41,786 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 337 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:41,786 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 596 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20662 states. [2025-04-13 18:58:41,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20662 to 10474. [2025-04-13 18:58:41,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10474 states, 10473 states have (on average 3.827365606798434) internal successors, (40084), 10473 states have internal predecessors, (40084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10474 states to 10474 states and 40084 transitions. [2025-04-13 18:58:42,034 INFO L79 Accepts]: Start accepts. Automaton has 10474 states and 40084 transitions. Word has length 54 [2025-04-13 18:58:42,034 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:42,034 INFO L485 AbstractCegarLoop]: Abstraction has 10474 states and 40084 transitions. [2025-04-13 18:58:42,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:42,034 INFO L278 IsEmpty]: Start isEmpty. Operand 10474 states and 40084 transitions. [2025-04-13 18:58:42,049 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:42,049 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:42,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:42,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2025-04-13 18:58:42,050 INFO L403 AbstractCegarLoop]: === Iteration 263 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:42,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:42,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1115602560, now seen corresponding path program 263 times [2025-04-13 18:58:42,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:42,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536133949] [2025-04-13 18:58:42,050 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:58:42,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:42,052 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:42,062 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:42,062 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:58:42,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:42,644 INFO L134 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:58:42,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:42,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536133949] [2025-04-13 18:58:42,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536133949] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:42,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:42,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:42,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389900112] [2025-04-13 18:58:42,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:42,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:42,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:42,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:42,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:42,645 INFO L87 Difference]: Start difference. First operand 10474 states and 40084 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:43,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:43,578 INFO L93 Difference]: Finished difference Result 19501 states and 71895 transitions. [2025-04-13 18:58:43,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:58:43,579 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:43,579 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:43,644 INFO L225 Difference]: With dead ends: 19501 [2025-04-13 18:58:43,644 INFO L226 Difference]: Without dead ends: 19425 [2025-04-13 18:58:43,651 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:58:43,651 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 319 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:43,651 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 595 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19425 states. [2025-04-13 18:58:43,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19425 to 10466. [2025-04-13 18:58:43,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10466 states, 10465 states have (on average 3.827615862398471) internal successors, (40056), 10465 states have internal predecessors, (40056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10466 states to 10466 states and 40056 transitions. [2025-04-13 18:58:43,946 INFO L79 Accepts]: Start accepts. Automaton has 10466 states and 40056 transitions. Word has length 54 [2025-04-13 18:58:43,946 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:43,946 INFO L485 AbstractCegarLoop]: Abstraction has 10466 states and 40056 transitions. [2025-04-13 18:58:43,946 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:43,946 INFO L278 IsEmpty]: Start isEmpty. Operand 10466 states and 40056 transitions. [2025-04-13 18:58:43,962 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:43,962 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:43,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:43,962 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262 [2025-04-13 18:58:43,962 INFO L403 AbstractCegarLoop]: === Iteration 264 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:43,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:43,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1010586452, now seen corresponding path program 264 times [2025-04-13 18:58:43,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:43,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932802498] [2025-04-13 18:58:43,963 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:58:43,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:43,965 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:43,975 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:43,975 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:58:43,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:44,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:58:44,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:44,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932802498] [2025-04-13 18:58:44,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932802498] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:44,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:44,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:44,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663427268] [2025-04-13 18:58:44,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:44,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:44,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:44,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:44,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:44,526 INFO L87 Difference]: Start difference. First operand 10466 states and 40056 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:45,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:45,457 INFO L93 Difference]: Finished difference Result 20725 states and 75882 transitions. [2025-04-13 18:58:45,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:58:45,457 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:45,457 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:45,525 INFO L225 Difference]: With dead ends: 20725 [2025-04-13 18:58:45,525 INFO L226 Difference]: Without dead ends: 20643 [2025-04-13 18:58:45,532 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:58:45,532 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 352 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:45,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 565 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:45,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20643 states. [2025-04-13 18:58:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20643 to 10455. [2025-04-13 18:58:45,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10455 states, 10454 states have (on average 3.8280084178304956) internal successors, (40018), 10454 states have internal predecessors, (40018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10455 states to 10455 states and 40018 transitions. [2025-04-13 18:58:45,783 INFO L79 Accepts]: Start accepts. Automaton has 10455 states and 40018 transitions. Word has length 54 [2025-04-13 18:58:45,783 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:45,783 INFO L485 AbstractCegarLoop]: Abstraction has 10455 states and 40018 transitions. [2025-04-13 18:58:45,783 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:45,783 INFO L278 IsEmpty]: Start isEmpty. Operand 10455 states and 40018 transitions. [2025-04-13 18:58:45,799 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:45,799 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:45,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:45,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable263 [2025-04-13 18:58:45,800 INFO L403 AbstractCegarLoop]: === Iteration 265 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:45,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:45,800 INFO L85 PathProgramCache]: Analyzing trace with hash 492712622, now seen corresponding path program 265 times [2025-04-13 18:58:45,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:45,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711375138] [2025-04-13 18:58:45,800 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:58:45,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:45,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:45,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:45,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:58:45,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:46,400 INFO L134 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:58:46,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:46,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711375138] [2025-04-13 18:58:46,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711375138] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:46,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:46,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:46,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079885565] [2025-04-13 18:58:46,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:46,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:46,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:46,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:46,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:46,401 INFO L87 Difference]: Start difference. First operand 10455 states and 40018 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:47,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:47,307 INFO L93 Difference]: Finished difference Result 19414 states and 71656 transitions. [2025-04-13 18:58:47,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:58:47,307 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:47,307 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:47,376 INFO L225 Difference]: With dead ends: 19414 [2025-04-13 18:58:47,377 INFO L226 Difference]: Without dead ends: 19178 [2025-04-13 18:58:47,383 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:58:47,383 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 298 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:47,384 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 562 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:47,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19178 states. [2025-04-13 18:58:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19178 to 10327. [2025-04-13 18:58:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10327 states, 10326 states have (on average 3.8359480921944606) internal successors, (39610), 10326 states have internal predecessors, (39610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10327 states to 10327 states and 39610 transitions. [2025-04-13 18:58:47,632 INFO L79 Accepts]: Start accepts. Automaton has 10327 states and 39610 transitions. Word has length 54 [2025-04-13 18:58:47,632 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:47,632 INFO L485 AbstractCegarLoop]: Abstraction has 10327 states and 39610 transitions. [2025-04-13 18:58:47,632 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:47,633 INFO L278 IsEmpty]: Start isEmpty. Operand 10327 states and 39610 transitions. [2025-04-13 18:58:47,648 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:47,648 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:47,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:47,649 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264 [2025-04-13 18:58:47,649 INFO L403 AbstractCegarLoop]: === Iteration 266 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:47,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1676065662, now seen corresponding path program 266 times [2025-04-13 18:58:47,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:47,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90636803] [2025-04-13 18:58:47,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:58:47,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:47,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:47,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:47,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:58:47,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:48,309 INFO L134 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:58:48,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:48,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90636803] [2025-04-13 18:58:48,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90636803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:48,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:48,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:48,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742946110] [2025-04-13 18:58:48,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:48,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:48,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:48,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:48,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:48,310 INFO L87 Difference]: Start difference. First operand 10327 states and 39610 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:49,180 INFO L93 Difference]: Finished difference Result 20515 states and 75256 transitions. [2025-04-13 18:58:49,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:58:49,180 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:49,180 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:49,244 INFO L225 Difference]: With dead ends: 20515 [2025-04-13 18:58:49,244 INFO L226 Difference]: Without dead ends: 20206 [2025-04-13 18:58:49,250 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:58:49,251 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 370 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:49,251 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 517 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20206 states. [2025-04-13 18:58:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20206 to 10135. [2025-04-13 18:58:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10135 states, 10134 states have (on average 3.8502072232089994) internal successors, (39018), 10134 states have internal predecessors, (39018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10135 states to 10135 states and 39018 transitions. [2025-04-13 18:58:49,496 INFO L79 Accepts]: Start accepts. Automaton has 10135 states and 39018 transitions. Word has length 54 [2025-04-13 18:58:49,496 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:49,496 INFO L485 AbstractCegarLoop]: Abstraction has 10135 states and 39018 transitions. [2025-04-13 18:58:49,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:49,496 INFO L278 IsEmpty]: Start isEmpty. Operand 10135 states and 39018 transitions. [2025-04-13 18:58:49,511 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:49,512 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:49,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:49,512 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265 [2025-04-13 18:58:49,512 INFO L403 AbstractCegarLoop]: === Iteration 267 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:49,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:49,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1090959934, now seen corresponding path program 267 times [2025-04-13 18:58:49,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:49,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967269575] [2025-04-13 18:58:49,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:58:49,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:49,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:49,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:49,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:58:49,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:50,172 INFO L134 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:58:50,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:50,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967269575] [2025-04-13 18:58:50,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967269575] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:50,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:50,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:50,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339940142] [2025-04-13 18:58:50,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:50,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:50,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:50,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:50,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:50,173 INFO L87 Difference]: Start difference. First operand 10135 states and 39018 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:51,184 INFO L93 Difference]: Finished difference Result 19212 states and 71037 transitions. [2025-04-13 18:58:51,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:51,184 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:51,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:51,248 INFO L225 Difference]: With dead ends: 19212 [2025-04-13 18:58:51,248 INFO L226 Difference]: Without dead ends: 19148 [2025-04-13 18:58:51,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:51,255 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 313 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:51,255 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 684 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:58:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19148 states. [2025-04-13 18:58:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19148 to 10211. [2025-04-13 18:58:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10211 states, 10210 states have (on average 3.8485798237022526) internal successors, (39294), 10210 states have internal predecessors, (39294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10211 states to 10211 states and 39294 transitions. [2025-04-13 18:58:51,498 INFO L79 Accepts]: Start accepts. Automaton has 10211 states and 39294 transitions. Word has length 54 [2025-04-13 18:58:51,498 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:51,499 INFO L485 AbstractCegarLoop]: Abstraction has 10211 states and 39294 transitions. [2025-04-13 18:58:51,499 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:51,499 INFO L278 IsEmpty]: Start isEmpty. Operand 10211 states and 39294 transitions. [2025-04-13 18:58:51,514 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:51,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:51,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] [2025-04-13 18:58:51,514 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable266 [2025-04-13 18:58:51,514 INFO L403 AbstractCegarLoop]: === Iteration 268 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:51,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:51,515 INFO L85 PathProgramCache]: Analyzing trace with hash -504037422, now seen corresponding path program 268 times [2025-04-13 18:58:51,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:51,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953527667] [2025-04-13 18:58:51,515 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:58:51,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:51,517 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:58:51,527 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:51,527 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:58:51,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:58:52,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:52,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953527667] [2025-04-13 18:58:52,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953527667] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:52,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:52,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:52,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387565075] [2025-04-13 18:58:52,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:52,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:52,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:52,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:52,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:52,121 INFO L87 Difference]: Start difference. First operand 10211 states and 39294 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:53,003 INFO L93 Difference]: Finished difference Result 20446 states and 75122 transitions. [2025-04-13 18:58:53,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:53,003 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:53,004 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:53,068 INFO L225 Difference]: With dead ends: 20446 [2025-04-13 18:58:53,068 INFO L226 Difference]: Without dead ends: 20376 [2025-04-13 18:58:53,074 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:53,075 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 385 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:53,075 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 590 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20376 states. [2025-04-13 18:58:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20376 to 10287. [2025-04-13 18:58:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10287 states, 10286 states have (on average 3.8469764728757534) internal successors, (39570), 10286 states have internal predecessors, (39570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10287 states to 10287 states and 39570 transitions. [2025-04-13 18:58:53,299 INFO L79 Accepts]: Start accepts. Automaton has 10287 states and 39570 transitions. Word has length 54 [2025-04-13 18:58:53,299 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:53,299 INFO L485 AbstractCegarLoop]: Abstraction has 10287 states and 39570 transitions. [2025-04-13 18:58:53,300 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:53,300 INFO L278 IsEmpty]: Start isEmpty. Operand 10287 states and 39570 transitions. [2025-04-13 18:58:53,314 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:53,314 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:53,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] [2025-04-13 18:58:53,315 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable267 [2025-04-13 18:58:53,315 INFO L403 AbstractCegarLoop]: === Iteration 269 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:53,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:53,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2060621854, now seen corresponding path program 269 times [2025-04-13 18:58:53,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:53,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585316847] [2025-04-13 18:58:53,315 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:58:53,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:53,317 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:53,328 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:53,328 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:58:53,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:53,919 INFO L134 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:58:53,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:53,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585316847] [2025-04-13 18:58:53,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585316847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:53,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:53,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:53,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300611138] [2025-04-13 18:58:53,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:53,920 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:53,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:53,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:53,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:53,920 INFO L87 Difference]: Start difference. First operand 10287 states and 39570 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:54,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:54,850 INFO L93 Difference]: Finished difference Result 19224 states and 71144 transitions. [2025-04-13 18:58:54,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:54,850 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:54,850 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:54,917 INFO L225 Difference]: With dead ends: 19224 [2025-04-13 18:58:54,918 INFO L226 Difference]: Without dead ends: 19146 [2025-04-13 18:58:54,923 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:54,923 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 325 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:54,924 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 612 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:54,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19146 states. [2025-04-13 18:58:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19146 to 10279. [2025-04-13 18:58:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10279 states, 10278 states have (on average 3.8472465460206267) internal successors, (39542), 10278 states have internal predecessors, (39542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10279 states to 10279 states and 39542 transitions. [2025-04-13 18:58:55,216 INFO L79 Accepts]: Start accepts. Automaton has 10279 states and 39542 transitions. Word has length 54 [2025-04-13 18:58:55,217 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:55,217 INFO L485 AbstractCegarLoop]: Abstraction has 10279 states and 39542 transitions. [2025-04-13 18:58:55,217 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:55,217 INFO L278 IsEmpty]: Start isEmpty. Operand 10279 states and 39542 transitions. [2025-04-13 18:58:55,232 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:55,232 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:55,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:55,232 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable268 [2025-04-13 18:58:55,232 INFO L403 AbstractCegarLoop]: === Iteration 270 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:55,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:55,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1473699342, now seen corresponding path program 270 times [2025-04-13 18:58:55,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:55,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618242602] [2025-04-13 18:58:55,233 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:58:55,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:55,236 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:55,246 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:55,246 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:58:55,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:58:55,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:55,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618242602] [2025-04-13 18:58:55,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618242602] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:55,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:55,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:55,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837714846] [2025-04-13 18:58:55,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:55,871 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:55,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:55,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:55,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:55,872 INFO L87 Difference]: Start difference. First operand 10279 states and 39542 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:56,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:56,784 INFO L93 Difference]: Finished difference Result 20368 states and 74908 transitions. [2025-04-13 18:58:56,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:56,784 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:56,785 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:56,853 INFO L225 Difference]: With dead ends: 20368 [2025-04-13 18:58:56,853 INFO L226 Difference]: Without dead ends: 20296 [2025-04-13 18:58:56,859 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:56,860 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 347 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:56,860 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 528 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20296 states. [2025-04-13 18:58:57,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20296 to 10271. [2025-04-13 18:58:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10271 states, 10270 states have (on average 3.8475170399221033) internal successors, (39514), 10270 states have internal predecessors, (39514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10271 states to 10271 states and 39514 transitions. [2025-04-13 18:58:57,106 INFO L79 Accepts]: Start accepts. Automaton has 10271 states and 39514 transitions. Word has length 54 [2025-04-13 18:58:57,106 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:57,106 INFO L485 AbstractCegarLoop]: Abstraction has 10271 states and 39514 transitions. [2025-04-13 18:58:57,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:57,107 INFO L278 IsEmpty]: Start isEmpty. Operand 10271 states and 39514 transitions. [2025-04-13 18:58:57,122 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:57,122 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:57,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:57,123 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269 [2025-04-13 18:58:57,123 INFO L403 AbstractCegarLoop]: === Iteration 271 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:57,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:57,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1587814852, now seen corresponding path program 271 times [2025-04-13 18:58:57,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:57,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318176114] [2025-04-13 18:58:57,123 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:58:57,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:57,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:57,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:57,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:58:57,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:57,751 INFO L134 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:58:57,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:57,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318176114] [2025-04-13 18:58:57,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318176114] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:57,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:57,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:57,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469726035] [2025-04-13 18:58:57,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:57,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:57,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:57,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:57,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:57,752 INFO L87 Difference]: Start difference. First operand 10271 states and 39514 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:58,691 INFO L93 Difference]: Finished difference Result 19250 states and 71215 transitions. [2025-04-13 18:58:58,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:58,691 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:58:58,691 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:58,755 INFO L225 Difference]: With dead ends: 19250 [2025-04-13 18:58:58,755 INFO L226 Difference]: Without dead ends: 19114 [2025-04-13 18:58:58,762 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:58:58,762 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 330 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:58,762 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 576 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:58:58,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19114 states. [2025-04-13 18:58:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19114 to 10247. [2025-04-13 18:58:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10247 states, 10246 states have (on average 3.8479406597696664) internal successors, (39426), 10246 states have internal predecessors, (39426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10247 states to 10247 states and 39426 transitions. [2025-04-13 18:58:58,999 INFO L79 Accepts]: Start accepts. Automaton has 10247 states and 39426 transitions. Word has length 54 [2025-04-13 18:58:58,999 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:58,999 INFO L485 AbstractCegarLoop]: Abstraction has 10247 states and 39426 transitions. [2025-04-13 18:58:58,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:58,999 INFO L278 IsEmpty]: Start isEmpty. Operand 10247 states and 39426 transitions. [2025-04-13 18:58:59,015 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:58:59,015 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:59,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:59,015 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2025-04-13 18:58:59,016 INFO L403 AbstractCegarLoop]: === Iteration 272 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:58:59,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:59,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1101651984, now seen corresponding path program 272 times [2025-04-13 18:58:59,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:59,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315973934] [2025-04-13 18:58:59,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:58:59,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:59,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:58:59,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:58:59,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:58:59,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:59,694 INFO L134 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:58:59,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:59,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315973934] [2025-04-13 18:58:59,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315973934] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:59,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:59,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:58:59,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117016930] [2025-04-13 18:58:59,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:59,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:58:59,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:59,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:58:59,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:58:59,695 INFO L87 Difference]: Start difference. First operand 10247 states and 39426 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:00,762 INFO L93 Difference]: Finished difference Result 20408 states and 75004 transitions. [2025-04-13 18:59:00,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:59:00,762 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:00,762 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:00,828 INFO L225 Difference]: With dead ends: 20408 [2025-04-13 18:59:00,828 INFO L226 Difference]: Without dead ends: 20248 [2025-04-13 18:59:00,834 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:00,834 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 304 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:00,834 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 627 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:59:00,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20248 states. [2025-04-13 18:59:01,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20248 to 10223. [2025-04-13 18:59:01,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10223 states, 10222 states have (on average 3.8483662688319313) internal successors, (39338), 10222 states have internal predecessors, (39338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10223 states to 10223 states and 39338 transitions. [2025-04-13 18:59:01,061 INFO L79 Accepts]: Start accepts. Automaton has 10223 states and 39338 transitions. Word has length 54 [2025-04-13 18:59:01,061 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:01,061 INFO L485 AbstractCegarLoop]: Abstraction has 10223 states and 39338 transitions. [2025-04-13 18:59:01,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:01,061 INFO L278 IsEmpty]: Start isEmpty. Operand 10223 states and 39338 transitions. [2025-04-13 18:59:01,076 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:01,076 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:01,076 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:01,076 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2025-04-13 18:59:01,076 INFO L403 AbstractCegarLoop]: === Iteration 273 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:01,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:01,077 INFO L85 PathProgramCache]: Analyzing trace with hash -20616642, now seen corresponding path program 273 times [2025-04-13 18:59:01,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:01,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355983549] [2025-04-13 18:59:01,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:59:01,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:01,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:01,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:01,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:59:01,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:01,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:59:01,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:01,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355983549] [2025-04-13 18:59:01,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355983549] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:01,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:01,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:01,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639125730] [2025-04-13 18:59:01,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:01,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:01,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:01,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:01,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:01,726 INFO L87 Difference]: Start difference. First operand 10223 states and 39338 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:02,645 INFO L93 Difference]: Finished difference Result 19338 states and 71401 transitions. [2025-04-13 18:59:02,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:59:02,645 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:02,645 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:02,708 INFO L225 Difference]: With dead ends: 19338 [2025-04-13 18:59:02,708 INFO L226 Difference]: Without dead ends: 19274 [2025-04-13 18:59:02,714 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:02,715 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 357 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:02,715 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 610 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:02,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19274 states. [2025-04-13 18:59:02,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19274 to 10235. [2025-04-13 18:59:02,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10235 states, 10234 states have (on average 3.8473715067422316) internal successors, (39374), 10234 states have internal predecessors, (39374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10235 states to 10235 states and 39374 transitions. [2025-04-13 18:59:02,951 INFO L79 Accepts]: Start accepts. Automaton has 10235 states and 39374 transitions. Word has length 54 [2025-04-13 18:59:02,951 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:02,951 INFO L485 AbstractCegarLoop]: Abstraction has 10235 states and 39374 transitions. [2025-04-13 18:59:02,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:02,951 INFO L278 IsEmpty]: Start isEmpty. Operand 10235 states and 39374 transitions. [2025-04-13 18:59:02,967 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:02,967 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:02,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:02,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2025-04-13 18:59:02,967 INFO L403 AbstractCegarLoop]: === Iteration 274 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:02,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:02,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1615613998, now seen corresponding path program 274 times [2025-04-13 18:59:02,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:02,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384867646] [2025-04-13 18:59:02,967 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:59:02,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:02,970 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:59:02,980 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:02,980 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:59:02,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:03,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:59:03,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:03,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384867646] [2025-04-13 18:59:03,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384867646] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:03,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:03,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:03,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945353104] [2025-04-13 18:59:03,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:03,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:03,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:03,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:03,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:03,526 INFO L87 Difference]: Start difference. First operand 10235 states and 39374 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:04,417 INFO L93 Difference]: Finished difference Result 20518 states and 75273 transitions. [2025-04-13 18:59:04,418 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:59:04,418 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:04,418 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:04,482 INFO L225 Difference]: With dead ends: 20518 [2025-04-13 18:59:04,482 INFO L226 Difference]: Without dead ends: 20448 [2025-04-13 18:59:04,489 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:04,490 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 381 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:04,490 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 591 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20448 states. [2025-04-13 18:59:04,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20448 to 10247. [2025-04-13 18:59:04,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10247 states, 10246 states have (on average 3.846379074760882) internal successors, (39410), 10246 states have internal predecessors, (39410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10247 states to 10247 states and 39410 transitions. [2025-04-13 18:59:04,730 INFO L79 Accepts]: Start accepts. Automaton has 10247 states and 39410 transitions. Word has length 54 [2025-04-13 18:59:04,730 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:04,730 INFO L485 AbstractCegarLoop]: Abstraction has 10247 states and 39410 transitions. [2025-04-13 18:59:04,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:04,730 INFO L278 IsEmpty]: Start isEmpty. Operand 10247 states and 39410 transitions. [2025-04-13 18:59:04,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:04,746 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:04,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:04,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273 [2025-04-13 18:59:04,746 INFO L403 AbstractCegarLoop]: === Iteration 275 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:04,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:04,746 INFO L85 PathProgramCache]: Analyzing trace with hash 949045278, now seen corresponding path program 275 times [2025-04-13 18:59:04,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:04,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341175205] [2025-04-13 18:59:04,746 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:59:04,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:04,749 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:04,760 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:04,760 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:59:04,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:05,369 INFO L134 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:59:05,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:05,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341175205] [2025-04-13 18:59:05,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341175205] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:05,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:05,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:05,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570381512] [2025-04-13 18:59:05,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:05,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:05,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:05,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:05,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:05,370 INFO L87 Difference]: Start difference. First operand 10247 states and 39410 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:06,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:06,268 INFO L93 Difference]: Finished difference Result 19356 states and 71446 transitions. [2025-04-13 18:59:06,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:59:06,268 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:06,268 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:06,334 INFO L225 Difference]: With dead ends: 19356 [2025-04-13 18:59:06,334 INFO L226 Difference]: Without dead ends: 19278 [2025-04-13 18:59:06,341 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:06,341 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 346 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:06,341 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 612 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:06,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19278 states. [2025-04-13 18:59:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19278 to 10239. [2025-04-13 18:59:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10239 states, 10238 states have (on average 3.847040437585466) internal successors, (39386), 10238 states have internal predecessors, (39386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10239 states to 10239 states and 39386 transitions. [2025-04-13 18:59:06,625 INFO L79 Accepts]: Start accepts. Automaton has 10239 states and 39386 transitions. Word has length 54 [2025-04-13 18:59:06,625 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:06,625 INFO L485 AbstractCegarLoop]: Abstraction has 10239 states and 39386 transitions. [2025-04-13 18:59:06,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:06,625 INFO L278 IsEmpty]: Start isEmpty. Operand 10239 states and 39386 transitions. [2025-04-13 18:59:06,640 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:06,640 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:06,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:06,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2025-04-13 18:59:06,641 INFO L403 AbstractCegarLoop]: === Iteration 276 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:06,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1709691378, now seen corresponding path program 276 times [2025-04-13 18:59:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:06,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822020950] [2025-04-13 18:59:06,641 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:59:06,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:06,644 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:06,653 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:06,653 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:59:06,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:07,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:59:07,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:07,240 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822020950] [2025-04-13 18:59:07,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822020950] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:07,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:07,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:07,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182720792] [2025-04-13 18:59:07,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:07,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:07,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:07,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:07,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:07,240 INFO L87 Difference]: Start difference. First operand 10239 states and 39386 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:08,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:08,155 INFO L93 Difference]: Finished difference Result 20504 states and 75224 transitions. [2025-04-13 18:59:08,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:59:08,156 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:08,156 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:08,223 INFO L225 Difference]: With dead ends: 20504 [2025-04-13 18:59:08,223 INFO L226 Difference]: Without dead ends: 20432 [2025-04-13 18:59:08,229 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:08,229 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 365 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:08,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 607 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:08,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20432 states. [2025-04-13 18:59:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20432 to 10231. [2025-04-13 18:59:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10231 states, 10230 states have (on average 3.847702834799609) internal successors, (39362), 10230 states have internal predecessors, (39362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10231 states to 10231 states and 39362 transitions. [2025-04-13 18:59:08,469 INFO L79 Accepts]: Start accepts. Automaton has 10231 states and 39362 transitions. Word has length 54 [2025-04-13 18:59:08,470 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:08,470 INFO L485 AbstractCegarLoop]: Abstraction has 10231 states and 39362 transitions. [2025-04-13 18:59:08,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:08,470 INFO L278 IsEmpty]: Start isEmpty. Operand 10231 states and 39362 transitions. [2025-04-13 18:59:08,485 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:08,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:08,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:08,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275 [2025-04-13 18:59:08,486 INFO L403 AbstractCegarLoop]: === Iteration 277 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:08,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:08,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1547532768, now seen corresponding path program 277 times [2025-04-13 18:59:08,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:08,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646247998] [2025-04-13 18:59:08,486 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:59:08,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:08,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:08,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:08,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:59:08,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:09,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:59:09,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:09,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646247998] [2025-04-13 18:59:09,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646247998] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:09,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:09,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:09,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345947396] [2025-04-13 18:59:09,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:09,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:09,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:09,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:09,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:09,131 INFO L87 Difference]: Start difference. First operand 10231 states and 39362 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:10,038 INFO L93 Difference]: Finished difference Result 19346 states and 71421 transitions. [2025-04-13 18:59:10,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:59:10,038 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:10,039 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:10,097 INFO L225 Difference]: With dead ends: 19346 [2025-04-13 18:59:10,097 INFO L226 Difference]: Without dead ends: 19282 [2025-04-13 18:59:10,102 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:10,103 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 341 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:10,103 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 570 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19282 states. [2025-04-13 18:59:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19282 to 10239. [2025-04-13 18:59:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10239 states, 10238 states have (on average 3.8466497362766163) internal successors, (39382), 10238 states have internal predecessors, (39382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10239 states to 10239 states and 39382 transitions. [2025-04-13 18:59:10,323 INFO L79 Accepts]: Start accepts. Automaton has 10239 states and 39382 transitions. Word has length 54 [2025-04-13 18:59:10,324 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:10,324 INFO L485 AbstractCegarLoop]: Abstraction has 10239 states and 39382 transitions. [2025-04-13 18:59:10,324 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:10,324 INFO L278 IsEmpty]: Start isEmpty. Operand 10239 states and 39382 transitions. [2025-04-13 18:59:10,339 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:10,339 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:10,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:59:10,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2025-04-13 18:59:10,339 INFO L403 AbstractCegarLoop]: === Iteration 278 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:10,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:10,339 INFO L85 PathProgramCache]: Analyzing trace with hash 816337844, now seen corresponding path program 278 times [2025-04-13 18:59:10,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:10,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55396038] [2025-04-13 18:59:10,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:59:10,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:10,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:10,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:10,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:59:10,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:11,005 INFO L134 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:59:11,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:11,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55396038] [2025-04-13 18:59:11,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55396038] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:11,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:11,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:11,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097391244] [2025-04-13 18:59:11,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:11,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:11,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:11,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:11,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:11,006 INFO L87 Difference]: Start difference. First operand 10239 states and 39382 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:11,929 INFO L93 Difference]: Finished difference Result 20522 states and 75277 transitions. [2025-04-13 18:59:11,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:59:11,930 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:11,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:11,996 INFO L225 Difference]: With dead ends: 20522 [2025-04-13 18:59:11,996 INFO L226 Difference]: Without dead ends: 20452 [2025-04-13 18:59:12,002 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:12,003 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 375 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:12,003 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 578 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:12,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20452 states. [2025-04-13 18:59:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20452 to 10250. [2025-04-13 18:59:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10250 states, 10249 states have (on average 3.8451556249390184) internal successors, (39409), 10249 states have internal predecessors, (39409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10250 states to 10250 states and 39409 transitions. [2025-04-13 18:59:12,258 INFO L79 Accepts]: Start accepts. Automaton has 10250 states and 39409 transitions. Word has length 54 [2025-04-13 18:59:12,258 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:12,258 INFO L485 AbstractCegarLoop]: Abstraction has 10250 states and 39409 transitions. [2025-04-13 18:59:12,258 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:12,258 INFO L278 IsEmpty]: Start isEmpty. Operand 10250 states and 39409 transitions. [2025-04-13 18:59:12,274 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:12,274 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:12,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:12,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable277 [2025-04-13 18:59:12,274 INFO L403 AbstractCegarLoop]: === Iteration 279 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:12,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:12,274 INFO L85 PathProgramCache]: Analyzing trace with hash 337453566, now seen corresponding path program 279 times [2025-04-13 18:59:12,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:12,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961681861] [2025-04-13 18:59:12,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:59:12,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:12,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:12,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:12,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:59:12,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:12,955 INFO L134 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:59:12,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:12,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961681861] [2025-04-13 18:59:12,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961681861] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:12,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:12,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:12,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445528022] [2025-04-13 18:59:12,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:12,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:12,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:12,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:12,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:12,956 INFO L87 Difference]: Start difference. First operand 10250 states and 39409 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:13,879 INFO L93 Difference]: Finished difference Result 19313 states and 71339 transitions. [2025-04-13 18:59:13,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:59:13,879 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:13,879 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:13,943 INFO L225 Difference]: With dead ends: 19313 [2025-04-13 18:59:13,943 INFO L226 Difference]: Without dead ends: 19237 [2025-04-13 18:59:13,949 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:13,949 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 336 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:13,949 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 574 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19237 states. [2025-04-13 18:59:14,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19237 to 10242. [2025-04-13 18:59:14,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 10241 states have (on average 3.845815838297041) internal successors, (39385), 10241 states have internal predecessors, (39385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 39385 transitions. [2025-04-13 18:59:14,188 INFO L79 Accepts]: Start accepts. Automaton has 10242 states and 39385 transitions. Word has length 54 [2025-04-13 18:59:14,188 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:14,188 INFO L485 AbstractCegarLoop]: Abstraction has 10242 states and 39385 transitions. [2025-04-13 18:59:14,188 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:14,188 INFO L278 IsEmpty]: Start isEmpty. Operand 10242 states and 39385 transitions. [2025-04-13 18:59:14,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:14,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:14,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] [2025-04-13 18:59:14,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable278 [2025-04-13 18:59:14,203 INFO L403 AbstractCegarLoop]: === Iteration 280 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:14,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:14,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1593643118, now seen corresponding path program 280 times [2025-04-13 18:59:14,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:14,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588106883] [2025-04-13 18:59:14,204 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:59:14,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:14,206 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:59:14,217 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:14,217 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:59:14,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:14,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:59:14,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:14,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588106883] [2025-04-13 18:59:14,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588106883] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:14,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:14,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:14,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772539855] [2025-04-13 18:59:14,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:14,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:14,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:14,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:14,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:14,756 INFO L87 Difference]: Start difference. First operand 10242 states and 39385 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:15,651 INFO L93 Difference]: Finished difference Result 20467 states and 75131 transitions. [2025-04-13 18:59:15,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:59:15,652 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:15,652 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:15,717 INFO L225 Difference]: With dead ends: 20467 [2025-04-13 18:59:15,717 INFO L226 Difference]: Without dead ends: 20385 [2025-04-13 18:59:15,724 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:15,724 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 364 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:15,724 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 535 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20385 states. [2025-04-13 18:59:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20385 to 10231. [2025-04-13 18:59:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10231 states, 10230 states have (on average 3.8469208211143693) internal successors, (39354), 10230 states have internal predecessors, (39354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10231 states to 10231 states and 39354 transitions. [2025-04-13 18:59:15,990 INFO L79 Accepts]: Start accepts. Automaton has 10231 states and 39354 transitions. Word has length 54 [2025-04-13 18:59:15,990 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:15,990 INFO L485 AbstractCegarLoop]: Abstraction has 10231 states and 39354 transitions. [2025-04-13 18:59:15,990 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:15,990 INFO L278 IsEmpty]: Start isEmpty. Operand 10231 states and 39354 transitions. [2025-04-13 18:59:16,012 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:16,012 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:16,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:16,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable279 [2025-04-13 18:59:16,012 INFO L403 AbstractCegarLoop]: === Iteration 281 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:16,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:16,013 INFO L85 PathProgramCache]: Analyzing trace with hash -745920512, now seen corresponding path program 281 times [2025-04-13 18:59:16,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:16,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401363462] [2025-04-13 18:59:16,013 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:59:16,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:16,016 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:16,027 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:16,028 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:59:16,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:59:16,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:16,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401363462] [2025-04-13 18:59:16,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401363462] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:16,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:16,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:16,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373075303] [2025-04-13 18:59:16,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:16,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:16,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:16,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:16,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:16,639 INFO L87 Difference]: Start difference. First operand 10231 states and 39354 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:17,584 INFO L93 Difference]: Finished difference Result 19254 states and 71164 transitions. [2025-04-13 18:59:17,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:59:17,585 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:17,585 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:17,669 INFO L225 Difference]: With dead ends: 19254 [2025-04-13 18:59:17,669 INFO L226 Difference]: Without dead ends: 19184 [2025-04-13 18:59:17,675 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:59:17,675 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 353 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:17,676 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 584 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:17,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19184 states. [2025-04-13 18:59:17,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19184 to 10241. [2025-04-13 18:59:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10241 states, 10240 states have (on average 3.84560546875) internal successors, (39379), 10240 states have internal predecessors, (39379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10241 states to 10241 states and 39379 transitions. [2025-04-13 18:59:17,977 INFO L79 Accepts]: Start accepts. Automaton has 10241 states and 39379 transitions. Word has length 54 [2025-04-13 18:59:17,977 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:17,977 INFO L485 AbstractCegarLoop]: Abstraction has 10241 states and 39379 transitions. [2025-04-13 18:59:17,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:17,977 INFO L278 IsEmpty]: Start isEmpty. Operand 10241 states and 39379 transitions. [2025-04-13 18:59:17,995 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:17,995 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:17,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] [2025-04-13 18:59:17,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280 [2025-04-13 18:59:17,995 INFO L403 AbstractCegarLoop]: === Iteration 282 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:17,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:17,996 INFO L85 PathProgramCache]: Analyzing trace with hash 14725588, now seen corresponding path program 282 times [2025-04-13 18:59:17,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:17,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099026281] [2025-04-13 18:59:17,996 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:59:17,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:17,998 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:18,008 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:18,008 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:59:18,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:18,579 INFO L134 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:59:18,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:18,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099026281] [2025-04-13 18:59:18,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099026281] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:18,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:18,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:18,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527792088] [2025-04-13 18:59:18,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:18,580 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:18,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:18,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:18,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:18,580 INFO L87 Difference]: Start difference. First operand 10241 states and 39379 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:19,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:19,437 INFO L93 Difference]: Finished difference Result 20420 states and 74991 transitions. [2025-04-13 18:59:19,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:59:19,438 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:19,438 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:19,501 INFO L225 Difference]: With dead ends: 20420 [2025-04-13 18:59:19,501 INFO L226 Difference]: Without dead ends: 20356 [2025-04-13 18:59:19,507 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:19,507 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 332 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:19,507 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 574 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:19,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20356 states. [2025-04-13 18:59:19,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20356 to 10249. [2025-04-13 18:59:19,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10249 states, 10248 states have (on average 3.844555035128806) internal successors, (39399), 10248 states have internal predecessors, (39399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 39399 transitions. [2025-04-13 18:59:19,731 INFO L79 Accepts]: Start accepts. Automaton has 10249 states and 39399 transitions. Word has length 54 [2025-04-13 18:59:19,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:19,731 INFO L485 AbstractCegarLoop]: Abstraction has 10249 states and 39399 transitions. [2025-04-13 18:59:19,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:19,731 INFO L278 IsEmpty]: Start isEmpty. Operand 10249 states and 39399 transitions. [2025-04-13 18:59:19,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:19,747 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:19,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:19,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable281 [2025-04-13 18:59:19,747 INFO L403 AbstractCegarLoop]: === Iteration 283 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:19,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:19,747 INFO L85 PathProgramCache]: Analyzing trace with hash 174655454, now seen corresponding path program 283 times [2025-04-13 18:59:19,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:19,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947007552] [2025-04-13 18:59:19,747 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:59:19,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:19,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:19,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:19,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:59:19,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:20,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:59:20,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:20,449 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947007552] [2025-04-13 18:59:20,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947007552] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:20,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:20,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:20,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707656925] [2025-04-13 18:59:20,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:20,449 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:20,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:20,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:20,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:20,450 INFO L87 Difference]: Start difference. First operand 10249 states and 39399 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:21,304 INFO L93 Difference]: Finished difference Result 19212 states and 71056 transitions. [2025-04-13 18:59:21,304 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:59:21,305 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:21,305 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:21,371 INFO L225 Difference]: With dead ends: 19212 [2025-04-13 18:59:21,371 INFO L226 Difference]: Without dead ends: 19130 [2025-04-13 18:59:21,377 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:21,377 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 334 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:21,377 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 589 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19130 states. [2025-04-13 18:59:21,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19130 to 10235. [2025-04-13 18:59:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10235 states, 10234 states have (on average 3.846198944694157) internal successors, (39362), 10234 states have internal predecessors, (39362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10235 states to 10235 states and 39362 transitions. [2025-04-13 18:59:21,626 INFO L79 Accepts]: Start accepts. Automaton has 10235 states and 39362 transitions. Word has length 54 [2025-04-13 18:59:21,626 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:21,626 INFO L485 AbstractCegarLoop]: Abstraction has 10235 states and 39362 transitions. [2025-04-13 18:59:21,626 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:21,626 INFO L278 IsEmpty]: Start isEmpty. Operand 10235 states and 39362 transitions. [2025-04-13 18:59:21,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:21,643 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:21,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] [2025-04-13 18:59:21,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable282 [2025-04-13 18:59:21,643 INFO L403 AbstractCegarLoop]: === Iteration 284 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:21,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:21,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1430845006, now seen corresponding path program 284 times [2025-04-13 18:59:21,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:21,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904046674] [2025-04-13 18:59:21,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:59:21,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:21,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:21,656 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:21,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:59:21,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:59:22,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:22,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904046674] [2025-04-13 18:59:22,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904046674] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:22,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:22,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:22,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971201845] [2025-04-13 18:59:22,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:22,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:22,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:22,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:22,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:22,261 INFO L87 Difference]: Start difference. First operand 10235 states and 39362 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:23,108 INFO L93 Difference]: Finished difference Result 20365 states and 74852 transitions. [2025-04-13 18:59:23,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:59:23,108 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:23,108 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:23,176 INFO L225 Difference]: With dead ends: 20365 [2025-04-13 18:59:23,176 INFO L226 Difference]: Without dead ends: 20282 [2025-04-13 18:59:23,182 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:23,182 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 361 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:23,182 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 542 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20282 states. [2025-04-13 18:59:23,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20282 to 10223. [2025-04-13 18:59:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10223 states, 10222 states have (on average 3.8475836431226766) internal successors, (39330), 10222 states have internal predecessors, (39330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10223 states to 10223 states and 39330 transitions. [2025-04-13 18:59:23,430 INFO L79 Accepts]: Start accepts. Automaton has 10223 states and 39330 transitions. Word has length 54 [2025-04-13 18:59:23,430 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:23,430 INFO L485 AbstractCegarLoop]: Abstraction has 10223 states and 39330 transitions. [2025-04-13 18:59:23,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:23,430 INFO L278 IsEmpty]: Start isEmpty. Operand 10223 states and 39330 transitions. [2025-04-13 18:59:23,446 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:23,446 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:23,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:23,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283 [2025-04-13 18:59:23,446 INFO L403 AbstractCegarLoop]: === Iteration 285 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:23,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:23,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1459222916, now seen corresponding path program 285 times [2025-04-13 18:59:23,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:23,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334546939] [2025-04-13 18:59:23,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:59:23,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:23,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:23,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:23,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:59:23,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:24,083 INFO L134 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:59:24,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:24,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334546939] [2025-04-13 18:59:24,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334546939] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:24,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:24,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:24,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723424717] [2025-04-13 18:59:24,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:24,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:24,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:24,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:24,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:24,084 INFO L87 Difference]: Start difference. First operand 10223 states and 39330 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:25,012 INFO L93 Difference]: Finished difference Result 19318 states and 71364 transitions. [2025-04-13 18:59:25,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:59:25,012 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:25,013 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:25,076 INFO L225 Difference]: With dead ends: 19318 [2025-04-13 18:59:25,076 INFO L226 Difference]: Without dead ends: 19206 [2025-04-13 18:59:25,082 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:25,083 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 335 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:25,083 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 585 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19206 states. [2025-04-13 18:59:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19206 to 10247. [2025-04-13 18:59:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10247 states, 10246 states have (on average 3.8444270934999025) internal successors, (39390), 10246 states have internal predecessors, (39390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10247 states to 10247 states and 39390 transitions. [2025-04-13 18:59:25,328 INFO L79 Accepts]: Start accepts. Automaton has 10247 states and 39390 transitions. Word has length 54 [2025-04-13 18:59:25,328 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:25,329 INFO L485 AbstractCegarLoop]: Abstraction has 10247 states and 39390 transitions. [2025-04-13 18:59:25,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:25,329 INFO L278 IsEmpty]: Start isEmpty. Operand 10247 states and 39390 transitions. [2025-04-13 18:59:25,344 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:25,344 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:25,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:59:25,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284 [2025-04-13 18:59:25,345 INFO L403 AbstractCegarLoop]: === Iteration 286 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:25,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:25,345 INFO L85 PathProgramCache]: Analyzing trace with hash -598900656, now seen corresponding path program 286 times [2025-04-13 18:59:25,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:25,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350534304] [2025-04-13 18:59:25,345 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:59:25,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:25,348 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:59:25,359 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:25,359 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:59:25,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:59:25,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:25,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350534304] [2025-04-13 18:59:25,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350534304] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:25,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:25,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:25,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985246177] [2025-04-13 18:59:25,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:25,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:25,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:25,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:25,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:25,915 INFO L87 Difference]: Start difference. First operand 10247 states and 39390 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:26,907 INFO L93 Difference]: Finished difference Result 20545 states and 75365 transitions. [2025-04-13 18:59:26,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:59:26,907 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:26,907 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:27,043 INFO L225 Difference]: With dead ends: 20545 [2025-04-13 18:59:27,043 INFO L226 Difference]: Without dead ends: 20409 [2025-04-13 18:59:27,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:27,047 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 354 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:27,047 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 591 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:27,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20409 states. [2025-04-13 18:59:27,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20409 to 10280. [2025-04-13 18:59:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10280 states, 10279 states have (on average 3.839964977137854) internal successors, (39471), 10279 states have internal predecessors, (39471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10280 states to 10280 states and 39471 transitions. [2025-04-13 18:59:27,258 INFO L79 Accepts]: Start accepts. Automaton has 10280 states and 39471 transitions. Word has length 54 [2025-04-13 18:59:27,258 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:27,258 INFO L485 AbstractCegarLoop]: Abstraction has 10280 states and 39471 transitions. [2025-04-13 18:59:27,258 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:27,258 INFO L278 IsEmpty]: Start isEmpty. Operand 10280 states and 39471 transitions. [2025-04-13 18:59:27,274 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:27,274 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:27,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:27,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable285 [2025-04-13 18:59:27,274 INFO L403 AbstractCegarLoop]: === Iteration 287 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:27,275 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:27,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1130275486, now seen corresponding path program 287 times [2025-04-13 18:59:27,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:27,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854979626] [2025-04-13 18:59:27,275 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:59:27,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:27,277 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:27,289 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:27,289 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:59:27,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:27,862 INFO L134 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:59:27,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:27,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854979626] [2025-04-13 18:59:27,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854979626] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:27,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:27,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:27,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633765503] [2025-04-13 18:59:27,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:27,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:27,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:27,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:27,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:27,863 INFO L87 Difference]: Start difference. First operand 10280 states and 39471 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:28,852 INFO L93 Difference]: Finished difference Result 19315 states and 71317 transitions. [2025-04-13 18:59:28,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:59:28,852 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:28,852 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:28,916 INFO L225 Difference]: With dead ends: 19315 [2025-04-13 18:59:28,916 INFO L226 Difference]: Without dead ends: 19251 [2025-04-13 18:59:28,922 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:28,922 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 316 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:28,922 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 651 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1650 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:59:28,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19251 states. [2025-04-13 18:59:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19251 to 10288. [2025-04-13 18:59:29,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10288 states, 10287 states have (on average 3.838922912413726) internal successors, (39491), 10287 states have internal predecessors, (39491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10288 states to 10288 states and 39491 transitions. [2025-04-13 18:59:29,250 INFO L79 Accepts]: Start accepts. Automaton has 10288 states and 39491 transitions. Word has length 54 [2025-04-13 18:59:29,250 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:29,250 INFO L485 AbstractCegarLoop]: Abstraction has 10288 states and 39491 transitions. [2025-04-13 18:59:29,250 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:29,250 INFO L278 IsEmpty]: Start isEmpty. Operand 10288 states and 39491 transitions. [2025-04-13 18:59:29,270 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:29,270 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:29,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:29,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable286 [2025-04-13 18:59:29,270 INFO L403 AbstractCegarLoop]: === Iteration 288 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:29,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:29,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1990597746, now seen corresponding path program 288 times [2025-04-13 18:59:29,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:29,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158143487] [2025-04-13 18:59:29,271 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:59:29,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:29,274 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:29,286 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:29,286 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:59:29,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:59:29,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:29,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158143487] [2025-04-13 18:59:29,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158143487] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:29,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:29,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:29,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372420212] [2025-04-13 18:59:29,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:29,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:29,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:29,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:29,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:29,890 INFO L87 Difference]: Start difference. First operand 10288 states and 39491 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:30,834 INFO L93 Difference]: Finished difference Result 20499 states and 75197 transitions. [2025-04-13 18:59:30,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:59:30,834 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:30,834 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:30,900 INFO L225 Difference]: With dead ends: 20499 [2025-04-13 18:59:30,900 INFO L226 Difference]: Without dead ends: 20429 [2025-04-13 18:59:30,908 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:30,908 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 345 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:30,908 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 582 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:30,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20429 states. [2025-04-13 18:59:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20429 to 10299. [2025-04-13 18:59:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10299 states, 10298 states have (on average 3.837444163915323) internal successors, (39518), 10298 states have internal predecessors, (39518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10299 states to 10299 states and 39518 transitions. [2025-04-13 18:59:31,151 INFO L79 Accepts]: Start accepts. Automaton has 10299 states and 39518 transitions. Word has length 54 [2025-04-13 18:59:31,152 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:31,152 INFO L485 AbstractCegarLoop]: Abstraction has 10299 states and 39518 transitions. [2025-04-13 18:59:31,152 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:31,152 INFO L278 IsEmpty]: Start isEmpty. Operand 10299 states and 39518 transitions. [2025-04-13 18:59:31,167 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:31,167 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:31,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:31,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable287 [2025-04-13 18:59:31,167 INFO L403 AbstractCegarLoop]: === Iteration 289 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:31,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:31,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1279705476, now seen corresponding path program 289 times [2025-04-13 18:59:31,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:31,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603323745] [2025-04-13 18:59:31,168 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:59:31,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:31,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:31,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:31,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:59:31,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:31,813 INFO L134 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:59:31,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:31,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603323745] [2025-04-13 18:59:31,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603323745] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:31,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:31,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:31,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136373182] [2025-04-13 18:59:31,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:31,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:31,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:31,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:31,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:31,814 INFO L87 Difference]: Start difference. First operand 10299 states and 39518 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:32,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:32,754 INFO L93 Difference]: Finished difference Result 19262 states and 71175 transitions. [2025-04-13 18:59:32,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:59:32,754 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:32,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:32,818 INFO L225 Difference]: With dead ends: 19262 [2025-04-13 18:59:32,818 INFO L226 Difference]: Without dead ends: 19150 [2025-04-13 18:59:32,823 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:32,824 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 304 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:32,824 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 594 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:32,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19150 states. [2025-04-13 18:59:32,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19150 to 10255. [2025-04-13 18:59:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10255 states, 10254 states have (on average 3.8418178271893897) internal successors, (39394), 10254 states have internal predecessors, (39394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10255 states to 10255 states and 39394 transitions. [2025-04-13 18:59:33,060 INFO L79 Accepts]: Start accepts. Automaton has 10255 states and 39394 transitions. Word has length 54 [2025-04-13 18:59:33,060 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:33,060 INFO L485 AbstractCegarLoop]: Abstraction has 10255 states and 39394 transitions. [2025-04-13 18:59:33,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:33,060 INFO L278 IsEmpty]: Start isEmpty. Operand 10255 states and 39394 transitions. [2025-04-13 18:59:33,075 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:33,075 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:33,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:33,076 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable288 [2025-04-13 18:59:33,076 INFO L403 AbstractCegarLoop]: === Iteration 290 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:33,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:33,076 INFO L85 PathProgramCache]: Analyzing trace with hash -419383216, now seen corresponding path program 290 times [2025-04-13 18:59:33,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:33,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333608793] [2025-04-13 18:59:33,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:59:33,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:33,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:33,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:33,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:59:33,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:59:33,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:33,713 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333608793] [2025-04-13 18:59:33,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333608793] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:33,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:33,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:33,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539346361] [2025-04-13 18:59:33,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:33,713 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:33,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:33,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:33,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:33,713 INFO L87 Difference]: Start difference. First operand 10255 states and 39394 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:34,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:34,647 INFO L93 Difference]: Finished difference Result 20385 states and 74884 transitions. [2025-04-13 18:59:34,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:59:34,648 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:34,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:34,712 INFO L225 Difference]: With dead ends: 20385 [2025-04-13 18:59:34,712 INFO L226 Difference]: Without dead ends: 20258 [2025-04-13 18:59:34,718 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:59:34,718 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 321 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:34,718 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 591 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:34,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20258 states. [2025-04-13 18:59:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20258 to 10199. [2025-04-13 18:59:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10199 states, 10198 states have (on average 3.848009413610512) internal successors, (39242), 10198 states have internal predecessors, (39242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10199 states to 10199 states and 39242 transitions. [2025-04-13 18:59:34,960 INFO L79 Accepts]: Start accepts. Automaton has 10199 states and 39242 transitions. Word has length 54 [2025-04-13 18:59:34,960 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:34,960 INFO L485 AbstractCegarLoop]: Abstraction has 10199 states and 39242 transitions. [2025-04-13 18:59:34,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:34,961 INFO L278 IsEmpty]: Start isEmpty. Operand 10199 states and 39242 transitions. [2025-04-13 18:59:34,976 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:34,976 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:34,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:34,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable289 [2025-04-13 18:59:34,976 INFO L403 AbstractCegarLoop]: === Iteration 291 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:34,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:34,976 INFO L85 PathProgramCache]: Analyzing trace with hash 973702432, now seen corresponding path program 291 times [2025-04-13 18:59:34,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:34,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359814141] [2025-04-13 18:59:34,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:59:34,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:34,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:34,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:34,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:59:34,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:35,591 INFO L134 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:59:35,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:35,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359814141] [2025-04-13 18:59:35,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359814141] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:35,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:35,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:35,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068433053] [2025-04-13 18:59:35,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:35,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:35,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:35,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:35,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:35,592 INFO L87 Difference]: Start difference. First operand 10199 states and 39242 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:36,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:36,641 INFO L93 Difference]: Finished difference Result 19410 states and 71638 transitions. [2025-04-13 18:59:36,642 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:59:36,642 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:36,642 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:36,704 INFO L225 Difference]: With dead ends: 19410 [2025-04-13 18:59:36,704 INFO L226 Difference]: Without dead ends: 19346 [2025-04-13 18:59:36,709 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=479, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:59:36,710 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 327 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:36,710 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 627 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:36,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19346 states. [2025-04-13 18:59:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19346 to 10219. [2025-04-13 18:59:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10219 states, 10218 states have (on average 3.8471325112546486) internal successors, (39310), 10218 states have internal predecessors, (39310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10219 states to 10219 states and 39310 transitions. [2025-04-13 18:59:36,948 INFO L79 Accepts]: Start accepts. Automaton has 10219 states and 39310 transitions. Word has length 54 [2025-04-13 18:59:36,948 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:36,948 INFO L485 AbstractCegarLoop]: Abstraction has 10219 states and 39310 transitions. [2025-04-13 18:59:36,948 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:36,948 INFO L278 IsEmpty]: Start isEmpty. Operand 10219 states and 39310 transitions. [2025-04-13 18:59:36,963 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:36,963 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:36,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:36,964 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290 [2025-04-13 18:59:36,964 INFO L403 AbstractCegarLoop]: === Iteration 292 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:36,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:36,964 INFO L85 PathProgramCache]: Analyzing trace with hash -621294924, now seen corresponding path program 292 times [2025-04-13 18:59:36,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:36,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724093612] [2025-04-13 18:59:36,964 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:59:36,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:36,966 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:59:36,976 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:36,976 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:59:36,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:37,601 INFO L134 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:59:37,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:37,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724093612] [2025-04-13 18:59:37,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724093612] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:37,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:37,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:37,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442090954] [2025-04-13 18:59:37,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:37,601 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:37,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:37,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:37,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:37,601 INFO L87 Difference]: Start difference. First operand 10219 states and 39310 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:38,620 INFO L93 Difference]: Finished difference Result 20644 states and 75668 transitions. [2025-04-13 18:59:38,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:59:38,620 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:38,620 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:38,684 INFO L225 Difference]: With dead ends: 20644 [2025-04-13 18:59:38,685 INFO L226 Difference]: Without dead ends: 20574 [2025-04-13 18:59:38,692 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=481, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:59:38,693 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 340 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:38,693 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 649 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:59:38,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20574 states. [2025-04-13 18:59:38,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20574 to 10239. [2025-04-13 18:59:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10239 states, 10238 states have (on average 3.846259034967767) internal successors, (39378), 10238 states have internal predecessors, (39378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:38,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10239 states to 10239 states and 39378 transitions. [2025-04-13 18:59:38,937 INFO L79 Accepts]: Start accepts. Automaton has 10239 states and 39378 transitions. Word has length 54 [2025-04-13 18:59:38,937 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:38,937 INFO L485 AbstractCegarLoop]: Abstraction has 10239 states and 39378 transitions. [2025-04-13 18:59:38,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:38,937 INFO L278 IsEmpty]: Start isEmpty. Operand 10239 states and 39378 transitions. [2025-04-13 18:59:38,952 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:38,953 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:38,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:38,953 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable291 [2025-04-13 18:59:38,953 INFO L403 AbstractCegarLoop]: === Iteration 293 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:38,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:38,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1943364352, now seen corresponding path program 293 times [2025-04-13 18:59:38,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:38,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759254080] [2025-04-13 18:59:38,953 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:59:38,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:38,956 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:38,966 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:38,966 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:59:38,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:39,533 INFO L134 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:59:39,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:39,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759254080] [2025-04-13 18:59:39,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759254080] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:39,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:39,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:39,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203996108] [2025-04-13 18:59:39,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:39,534 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:39,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:39,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:39,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:39,534 INFO L87 Difference]: Start difference. First operand 10239 states and 39378 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:40,520 INFO L93 Difference]: Finished difference Result 19388 states and 71571 transitions. [2025-04-13 18:59:40,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:59:40,520 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:40,520 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:40,585 INFO L225 Difference]: With dead ends: 19388 [2025-04-13 18:59:40,585 INFO L226 Difference]: Without dead ends: 19310 [2025-04-13 18:59:40,591 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:59:40,591 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 351 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:40,591 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 562 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19310 states. [2025-04-13 18:59:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19310 to 10231. [2025-04-13 18:59:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10231 states, 10230 states have (on average 3.8469208211143693) internal successors, (39354), 10230 states have internal predecessors, (39354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10231 states to 10231 states and 39354 transitions. [2025-04-13 18:59:40,867 INFO L79 Accepts]: Start accepts. Automaton has 10231 states and 39354 transitions. Word has length 54 [2025-04-13 18:59:40,867 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:40,867 INFO L485 AbstractCegarLoop]: Abstraction has 10231 states and 39354 transitions. [2025-04-13 18:59:40,867 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:40,867 INFO L278 IsEmpty]: Start isEmpty. Operand 10231 states and 39354 transitions. [2025-04-13 18:59:40,883 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:40,883 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:40,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:40,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292 [2025-04-13 18:59:40,883 INFO L403 AbstractCegarLoop]: === Iteration 294 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:40,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:40,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1590956844, now seen corresponding path program 294 times [2025-04-13 18:59:40,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:40,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706762292] [2025-04-13 18:59:40,884 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:59:40,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:40,886 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:40,896 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:40,896 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:59:40,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:41,514 INFO L134 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:59:41,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:41,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706762292] [2025-04-13 18:59:41,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706762292] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:41,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:41,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:41,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340276792] [2025-04-13 18:59:41,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:41,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:41,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:41,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:41,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:41,515 INFO L87 Difference]: Start difference. First operand 10231 states and 39354 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:42,535 INFO L93 Difference]: Finished difference Result 20564 states and 75424 transitions. [2025-04-13 18:59:42,535 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:59:42,536 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:42,536 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:42,603 INFO L225 Difference]: With dead ends: 20564 [2025-04-13 18:59:42,604 INFO L226 Difference]: Without dead ends: 20492 [2025-04-13 18:59:42,613 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:59:42,613 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 375 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:42,613 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 562 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20492 states. [2025-04-13 18:59:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20492 to 10223. [2025-04-13 18:59:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10223 states, 10222 states have (on average 3.8475836431226766) internal successors, (39330), 10222 states have internal predecessors, (39330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10223 states to 10223 states and 39330 transitions. [2025-04-13 18:59:42,961 INFO L79 Accepts]: Start accepts. Automaton has 10223 states and 39330 transitions. Word has length 54 [2025-04-13 18:59:42,961 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:42,961 INFO L485 AbstractCegarLoop]: Abstraction has 10223 states and 39330 transitions. [2025-04-13 18:59:42,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:42,961 INFO L278 IsEmpty]: Start isEmpty. Operand 10223 states and 39330 transitions. [2025-04-13 18:59:42,977 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:42,977 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:42,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:59:42,977 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable293 [2025-04-13 18:59:42,977 INFO L403 AbstractCegarLoop]: === Iteration 295 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:42,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:42,978 INFO L85 PathProgramCache]: Analyzing trace with hash -553213694, now seen corresponding path program 295 times [2025-04-13 18:59:42,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:42,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827184365] [2025-04-13 18:59:42,978 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:59:42,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:42,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:42,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:42,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:59:42,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:43,594 INFO L134 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:59:43,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:43,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827184365] [2025-04-13 18:59:43,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827184365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:43,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:43,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:43,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895181992] [2025-04-13 18:59:43,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:43,595 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:43,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:43,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:43,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:43,595 INFO L87 Difference]: Start difference. First operand 10223 states and 39330 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:44,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:44,551 INFO L93 Difference]: Finished difference Result 19442 states and 71707 transitions. [2025-04-13 18:59:44,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:59:44,551 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:44,551 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:44,617 INFO L225 Difference]: With dead ends: 19442 [2025-04-13 18:59:44,617 INFO L226 Difference]: Without dead ends: 19378 [2025-04-13 18:59:44,623 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:59:44,623 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 346 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:44,623 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 555 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:44,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19378 states. [2025-04-13 18:59:44,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19378 to 10231. [2025-04-13 18:59:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10231 states, 10230 states have (on average 3.84652981427175) internal successors, (39350), 10230 states have internal predecessors, (39350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10231 states to 10231 states and 39350 transitions. [2025-04-13 18:59:44,861 INFO L79 Accepts]: Start accepts. Automaton has 10231 states and 39350 transitions. Word has length 54 [2025-04-13 18:59:44,862 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:44,862 INFO L485 AbstractCegarLoop]: Abstraction has 10231 states and 39350 transitions. [2025-04-13 18:59:44,862 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:44,862 INFO L278 IsEmpty]: Start isEmpty. Operand 10231 states and 39350 transitions. [2025-04-13 18:59:44,877 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:44,877 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:44,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:59:44,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable294 [2025-04-13 18:59:44,877 INFO L403 AbstractCegarLoop]: === Iteration 296 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:44,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:44,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1810656918, now seen corresponding path program 296 times [2025-04-13 18:59:44,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:44,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425344441] [2025-04-13 18:59:44,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:59:44,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:44,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:44,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:44,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:59:44,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:45,523 INFO L134 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:59:45,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:45,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425344441] [2025-04-13 18:59:45,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425344441] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:45,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:45,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:45,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119882144] [2025-04-13 18:59:45,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:45,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:45,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:45,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:45,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:45,524 INFO L87 Difference]: Start difference. First operand 10231 states and 39350 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:46,491 INFO L93 Difference]: Finished difference Result 20652 states and 75655 transitions. [2025-04-13 18:59:46,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:59:46,491 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:46,491 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:46,560 INFO L225 Difference]: With dead ends: 20652 [2025-04-13 18:59:46,560 INFO L226 Difference]: Without dead ends: 20582 [2025-04-13 18:59:46,567 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:59:46,567 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 369 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:46,567 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 548 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20582 states. [2025-04-13 18:59:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20582 to 10242. [2025-04-13 18:59:46,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 10241 states have (on average 3.8450346645835367) internal successors, (39377), 10241 states have internal predecessors, (39377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:46,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 39377 transitions. [2025-04-13 18:59:46,819 INFO L79 Accepts]: Start accepts. Automaton has 10242 states and 39377 transitions. Word has length 54 [2025-04-13 18:59:46,819 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:46,819 INFO L485 AbstractCegarLoop]: Abstraction has 10242 states and 39377 transitions. [2025-04-13 18:59:46,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:46,819 INFO L278 IsEmpty]: Start isEmpty. Operand 10242 states and 39377 transitions. [2025-04-13 18:59:46,834 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:46,834 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:46,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:46,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable295 [2025-04-13 18:59:46,834 INFO L403 AbstractCegarLoop]: === Iteration 297 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:46,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:46,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1331772640, now seen corresponding path program 297 times [2025-04-13 18:59:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:46,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309604664] [2025-04-13 18:59:46,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:59:46,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:46,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:46,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:46,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:59:46,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59: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:59:47,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:47,449 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309604664] [2025-04-13 18:59:47,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309604664] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:47,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:47,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:47,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154851598] [2025-04-13 18:59:47,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:47,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:47,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:47,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:47,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:47,450 INFO L87 Difference]: Start difference. First operand 10242 states and 39377 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:48,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:48,419 INFO L93 Difference]: Finished difference Result 19409 states and 71625 transitions. [2025-04-13 18:59:48,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:59:48,419 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:48,420 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:48,483 INFO L225 Difference]: With dead ends: 19409 [2025-04-13 18:59:48,483 INFO L226 Difference]: Without dead ends: 19333 [2025-04-13 18:59:48,489 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:59:48,489 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 311 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:48,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 547 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19333 states. [2025-04-13 18:59:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19333 to 10234. [2025-04-13 18:59:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10234 states, 10233 states have (on average 3.845695299521157) internal successors, (39353), 10233 states have internal predecessors, (39353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10234 states to 10234 states and 39353 transitions. [2025-04-13 18:59:48,730 INFO L79 Accepts]: Start accepts. Automaton has 10234 states and 39353 transitions. Word has length 54 [2025-04-13 18:59:48,730 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:48,730 INFO L485 AbstractCegarLoop]: Abstraction has 10234 states and 39353 transitions. [2025-04-13 18:59:48,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:48,730 INFO L278 IsEmpty]: Start isEmpty. Operand 10234 states and 39353 transitions. [2025-04-13 18:59:48,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:48,746 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:48,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:48,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2025-04-13 18:59:48,746 INFO L403 AbstractCegarLoop]: === Iteration 298 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:48,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:48,746 INFO L85 PathProgramCache]: Analyzing trace with hash -599324044, now seen corresponding path program 298 times [2025-04-13 18:59:48,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:48,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720568862] [2025-04-13 18:59:48,746 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:59:48,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:48,749 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 18:59:48,759 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:48,759 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:59:48,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:49,389 INFO L134 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:59:49,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:49,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720568862] [2025-04-13 18:59:49,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720568862] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:49,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:49,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:49,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806735964] [2025-04-13 18:59:49,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:49,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:49,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:49,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:49,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:49,390 INFO L87 Difference]: Start difference. First operand 10234 states and 39353 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:50,332 INFO L93 Difference]: Finished difference Result 20597 states and 75509 transitions. [2025-04-13 18:59:50,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:59:50,332 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:50,332 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:50,403 INFO L225 Difference]: With dead ends: 20597 [2025-04-13 18:59:50,403 INFO L226 Difference]: Without dead ends: 20515 [2025-04-13 18:59:50,410 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:59:50,410 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 351 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:50,410 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 573 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:50,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20515 states. [2025-04-13 18:59:50,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20515 to 10223. [2025-04-13 18:59:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10223 states, 10222 states have (on average 3.846801017413422) internal successors, (39322), 10222 states have internal predecessors, (39322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10223 states to 10223 states and 39322 transitions. [2025-04-13 18:59:50,658 INFO L79 Accepts]: Start accepts. Automaton has 10223 states and 39322 transitions. Word has length 54 [2025-04-13 18:59:50,658 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:50,658 INFO L485 AbstractCegarLoop]: Abstraction has 10223 states and 39322 transitions. [2025-04-13 18:59:50,658 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:50,658 INFO L278 IsEmpty]: Start isEmpty. Operand 10223 states and 39322 transitions. [2025-04-13 18:59:50,674 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:50,674 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:50,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:50,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable297 [2025-04-13 18:59:50,674 INFO L403 AbstractCegarLoop]: === Iteration 299 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:50,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:50,674 INFO L85 PathProgramCache]: Analyzing trace with hash 248398562, now seen corresponding path program 299 times [2025-04-13 18:59:50,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:50,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941159439] [2025-04-13 18:59:50,674 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:59:50,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:50,677 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:50,687 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:50,687 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:59:50,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:51,255 INFO L134 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:59:51,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:51,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941159439] [2025-04-13 18:59:51,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941159439] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:51,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:51,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:51,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718019299] [2025-04-13 18:59:51,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:51,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:51,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:51,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:51,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:51,256 INFO L87 Difference]: Start difference. First operand 10223 states and 39322 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:52,237 INFO L93 Difference]: Finished difference Result 19450 states and 71723 transitions. [2025-04-13 18:59:52,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:59:52,237 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:52,237 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:52,304 INFO L225 Difference]: With dead ends: 19450 [2025-04-13 18:59:52,304 INFO L226 Difference]: Without dead ends: 19380 [2025-04-13 18:59:52,308 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:59:52,309 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 368 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:52,309 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 555 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19380 states. [2025-04-13 18:59:52,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19380 to 10233. [2025-04-13 18:59:52,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10233 states, 10232 states have (on average 3.845484753713839) internal successors, (39347), 10232 states have internal predecessors, (39347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10233 states to 10233 states and 39347 transitions. [2025-04-13 18:59:52,536 INFO L79 Accepts]: Start accepts. Automaton has 10233 states and 39347 transitions. Word has length 54 [2025-04-13 18:59:52,536 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:52,536 INFO L485 AbstractCegarLoop]: Abstraction has 10233 states and 39347 transitions. [2025-04-13 18:59:52,536 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:52,536 INFO L278 IsEmpty]: Start isEmpty. Operand 10233 states and 39347 transitions. [2025-04-13 18:59:52,552 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:52,552 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:52,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] [2025-04-13 18:59:52,552 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable298 [2025-04-13 18:59:52,552 INFO L403 AbstractCegarLoop]: === Iteration 300 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:52,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:52,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1009044662, now seen corresponding path program 300 times [2025-04-13 18:59:52,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:52,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674915056] [2025-04-13 18:59:52,552 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:59:52,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:52,555 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:52,565 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:52,565 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:59:52,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:53,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:59:53,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:53,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674915056] [2025-04-13 18:59:53,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674915056] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:53,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:53,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:53,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591138166] [2025-04-13 18:59:53,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:53,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:53,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:53,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:53,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:53,144 INFO L87 Difference]: Start difference. First operand 10233 states and 39347 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:54,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:54,091 INFO L93 Difference]: Finished difference Result 20645 states and 75625 transitions. [2025-04-13 18:59:54,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:59:54,092 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:54,092 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:54,160 INFO L225 Difference]: With dead ends: 20645 [2025-04-13 18:59:54,160 INFO L226 Difference]: Without dead ends: 20581 [2025-04-13 18:59:54,166 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:59:54,166 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 388 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:54,166 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 540 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:54,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20581 states. [2025-04-13 18:59:54,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20581 to 10241. [2025-04-13 18:59:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10241 states, 10240 states have (on average 3.84443359375) internal successors, (39367), 10240 states have internal predecessors, (39367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10241 states to 10241 states and 39367 transitions. [2025-04-13 18:59:54,485 INFO L79 Accepts]: Start accepts. Automaton has 10241 states and 39367 transitions. Word has length 54 [2025-04-13 18:59:54,485 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:54,485 INFO L485 AbstractCegarLoop]: Abstraction has 10241 states and 39367 transitions. [2025-04-13 18:59:54,485 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:54,485 INFO L278 IsEmpty]: Start isEmpty. Operand 10241 states and 39367 transitions. [2025-04-13 18:59:54,500 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:54,501 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:54,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:54,501 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable299 [2025-04-13 18:59:54,501 INFO L403 AbstractCegarLoop]: === Iteration 301 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:54,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:54,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1168974528, now seen corresponding path program 301 times [2025-04-13 18:59:54,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:54,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882552446] [2025-04-13 18:59:54,502 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:59:54,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:54,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:54,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:54,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:59:54,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:55,083 INFO L134 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:59:55,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:55,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882552446] [2025-04-13 18:59:55,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882552446] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:55,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:55,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:55,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356618311] [2025-04-13 18:59:55,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:55,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:55,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:55,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:55,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:55,084 INFO L87 Difference]: Start difference. First operand 10241 states and 39367 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:56,064 INFO L93 Difference]: Finished difference Result 19408 states and 71615 transitions. [2025-04-13 18:59:56,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:59:56,064 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:56,064 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:56,130 INFO L225 Difference]: With dead ends: 19408 [2025-04-13 18:59:56,130 INFO L226 Difference]: Without dead ends: 19326 [2025-04-13 18:59:56,136 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:59:56,136 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 332 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:56,137 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 578 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:59:56,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19326 states. [2025-04-13 18:59:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19326 to 10227. [2025-04-13 18:59:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10227 states, 10226 states have (on average 3.8460786231175437) internal successors, (39330), 10226 states have internal predecessors, (39330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10227 states to 10227 states and 39330 transitions. [2025-04-13 18:59:56,378 INFO L79 Accepts]: Start accepts. Automaton has 10227 states and 39330 transitions. Word has length 54 [2025-04-13 18:59:56,378 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:56,378 INFO L485 AbstractCegarLoop]: Abstraction has 10227 states and 39330 transitions. [2025-04-13 18:59:56,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:56,378 INFO L278 IsEmpty]: Start isEmpty. Operand 10227 states and 39330 transitions. [2025-04-13 18:59:56,393 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:56,393 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:56,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:56,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable300 [2025-04-13 18:59:56,394 INFO L403 AbstractCegarLoop]: === Iteration 302 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:56,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash -436525932, now seen corresponding path program 302 times [2025-04-13 18:59:56,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:56,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220400542] [2025-04-13 18:59:56,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:59:56,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:56,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:56,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:56,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:59:56,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:57,072 INFO L134 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:59:57,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:57,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220400542] [2025-04-13 18:59:57,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220400542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:57,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:57,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:57,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540937014] [2025-04-13 18:59:57,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:57,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:57,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:57,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:57,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:57,073 INFO L87 Difference]: Start difference. First operand 10227 states and 39330 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:58,083 INFO L93 Difference]: Finished difference Result 20590 states and 75486 transitions. [2025-04-13 18:59:58,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:59:58,083 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:58,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:58,147 INFO L225 Difference]: With dead ends: 20590 [2025-04-13 18:59:58,148 INFO L226 Difference]: Without dead ends: 20507 [2025-04-13 18:59:58,154 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:59:58,154 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 345 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 1579 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:58,154 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 603 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1579 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:59:58,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20507 states. [2025-04-13 18:59:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20507 to 10215. [2025-04-13 18:59:58,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10215 states, 10214 states have (on average 3.8474642647346777) internal successors, (39298), 10214 states have internal predecessors, (39298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10215 states to 10215 states and 39298 transitions. [2025-04-13 18:59:58,400 INFO L79 Accepts]: Start accepts. Automaton has 10215 states and 39298 transitions. Word has length 54 [2025-04-13 18:59:58,400 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:58,400 INFO L485 AbstractCegarLoop]: Abstraction has 10215 states and 39298 transitions. [2025-04-13 18:59:58,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:58,400 INFO L278 IsEmpty]: Start isEmpty. Operand 10215 states and 39298 transitions. [2025-04-13 18:59:58,416 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:59:58,416 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:58,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] [2025-04-13 18:59:58,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable301 [2025-04-13 18:59:58,416 INFO L403 AbstractCegarLoop]: === Iteration 303 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:59:58,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:58,417 INFO L85 PathProgramCache]: Analyzing trace with hash -398776176, now seen corresponding path program 303 times [2025-04-13 18:59:58,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:58,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456442941] [2025-04-13 18:59:58,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:59:58,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:58,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:59:58,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:59:58,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:59:58,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:59,028 INFO L134 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:59:59,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:59,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456442941] [2025-04-13 18:59:59,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456442941] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:59,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:59,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:59:59,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790313632] [2025-04-13 18:59:59,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:59,028 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:59,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:59,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:59,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:59,029 INFO L87 Difference]: Start difference. First operand 10215 states and 39298 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:59,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:59,998 INFO L93 Difference]: Finished difference Result 19530 states and 71998 transitions. [2025-04-13 18:59:59,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:59:59,999 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 18:59:59,999 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:00,065 INFO L225 Difference]: With dead ends: 19530 [2025-04-13 19:00:00,065 INFO L226 Difference]: Without dead ends: 19466 [2025-04-13 19:00:00,071 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2025-04-13 19:00:00,071 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 313 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:00,071 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 554 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:00,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19466 states. [2025-04-13 19:00:00,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19466 to 10239. [2025-04-13 19:00:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10239 states, 10238 states have (on average 3.8458683336589177) internal successors, (39374), 10238 states have internal predecessors, (39374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:00,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10239 states to 10239 states and 39374 transitions. [2025-04-13 19:00:00,309 INFO L79 Accepts]: Start accepts. Automaton has 10239 states and 39374 transitions. Word has length 54 [2025-04-13 19:00:00,309 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:00,309 INFO L485 AbstractCegarLoop]: Abstraction has 10239 states and 39374 transitions. [2025-04-13 19:00:00,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:00,310 INFO L278 IsEmpty]: Start isEmpty. Operand 10239 states and 39374 transitions. [2025-04-13 19:00:00,325 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:00,325 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:00,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] [2025-04-13 19:00:00,325 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable302 [2025-04-13 19:00:00,325 INFO L403 AbstractCegarLoop]: === Iteration 304 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:00,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:00,326 INFO L85 PathProgramCache]: Analyzing trace with hash 461546084, now seen corresponding path program 304 times [2025-04-13 19:00:00,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:00,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535862762] [2025-04-13 19:00:00,326 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:00:00,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:00,328 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:00:00,340 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:00,340 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:00:00,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:00,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:00,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535862762] [2025-04-13 19:00:00,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535862762] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:00,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:00,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:00,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20872414] [2025-04-13 19:00:00,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:00,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:00,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:00,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:00,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:00,927 INFO L87 Difference]: Start difference. First operand 10239 states and 39374 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:01,813 INFO L93 Difference]: Finished difference Result 20801 states and 76128 transitions. [2025-04-13 19:00:01,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 19:00:01,814 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:01,814 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:01,885 INFO L225 Difference]: With dead ends: 20801 [2025-04-13 19:00:01,885 INFO L226 Difference]: Without dead ends: 20731 [2025-04-13 19:00:01,892 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=476, Unknown=0, NotChecked=0, Total=702 [2025-04-13 19:00:01,892 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 354 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:01,892 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 559 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:01,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20731 states. [2025-04-13 19:00:02,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20731 to 10272. [2025-04-13 19:00:02,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10272 states, 10271 states have (on average 3.843540064258592) internal successors, (39477), 10271 states have internal predecessors, (39477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10272 states to 10272 states and 39477 transitions. [2025-04-13 19:00:02,150 INFO L79 Accepts]: Start accepts. Automaton has 10272 states and 39477 transitions. Word has length 54 [2025-04-13 19:00:02,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:02,150 INFO L485 AbstractCegarLoop]: Abstraction has 10272 states and 39477 transitions. [2025-04-13 19:00:02,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:02,150 INFO L278 IsEmpty]: Start isEmpty. Operand 10272 states and 39477 transitions. [2025-04-13 19:00:02,165 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:02,165 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:02,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:02,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable303 [2025-04-13 19:00:02,166 INFO L403 AbstractCegarLoop]: === Iteration 305 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:02,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:02,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1486210158, now seen corresponding path program 305 times [2025-04-13 19:00:02,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:02,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577925469] [2025-04-13 19:00:02,166 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:00:02,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:02,168 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:02,180 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:02,180 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:00:02,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:02,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:02,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577925469] [2025-04-13 19:00:02,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577925469] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:02,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:02,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:02,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545719112] [2025-04-13 19:00:02,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:02,799 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:02,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:02,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:02,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:02,799 INFO L87 Difference]: Start difference. First operand 10272 states and 39477 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:03,819 INFO L93 Difference]: Finished difference Result 19519 states and 71961 transitions. [2025-04-13 19:00:03,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:00:03,820 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:03,820 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:03,885 INFO L225 Difference]: With dead ends: 19519 [2025-04-13 19:00:03,885 INFO L226 Difference]: Without dead ends: 19443 [2025-04-13 19:00:03,889 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=441, Unknown=0, NotChecked=0, Total=650 [2025-04-13 19:00:03,889 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 342 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:03,889 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 516 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:03,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19443 states. [2025-04-13 19:00:04,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19443 to 10264. [2025-04-13 19:00:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10264 states, 10263 states have (on average 3.8438078534541558) internal successors, (39449), 10263 states have internal predecessors, (39449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:04,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10264 states to 10264 states and 39449 transitions. [2025-04-13 19:00:04,140 INFO L79 Accepts]: Start accepts. Automaton has 10264 states and 39449 transitions. Word has length 54 [2025-04-13 19:00:04,141 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:04,141 INFO L485 AbstractCegarLoop]: Abstraction has 10264 states and 39449 transitions. [2025-04-13 19:00:04,141 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:04,141 INFO L278 IsEmpty]: Start isEmpty. Operand 10264 states and 39449 transitions. [2025-04-13 19:00:04,156 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:04,156 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:04,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:04,157 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304 [2025-04-13 19:00:04,157 INFO L403 AbstractCegarLoop]: === Iteration 306 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:04,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:04,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1948434878, now seen corresponding path program 306 times [2025-04-13 19:00:04,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:04,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362658023] [2025-04-13 19:00:04,157 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:00:04,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:04,159 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:04,169 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:04,169 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:00:04,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:04,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:04,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362658023] [2025-04-13 19:00:04,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362658023] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:04,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:04,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:04,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532992348] [2025-04-13 19:00:04,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:04,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:04,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:04,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:04,748 INFO L87 Difference]: Start difference. First operand 10264 states and 39449 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:05,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:05,697 INFO L93 Difference]: Finished difference Result 20728 states and 75896 transitions. [2025-04-13 19:00:05,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:00:05,697 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:05,698 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:05,766 INFO L225 Difference]: With dead ends: 20728 [2025-04-13 19:00:05,766 INFO L226 Difference]: Without dead ends: 20646 [2025-04-13 19:00:05,772 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=440, Unknown=0, NotChecked=0, Total=650 [2025-04-13 19:00:05,772 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 374 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:05,772 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 483 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20646 states. [2025-04-13 19:00:06,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20646 to 10253. [2025-04-13 19:00:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10253 states, 10252 states have (on average 3.844225516972298) internal successors, (39411), 10252 states have internal predecessors, (39411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10253 states to 10253 states and 39411 transitions. [2025-04-13 19:00:06,107 INFO L79 Accepts]: Start accepts. Automaton has 10253 states and 39411 transitions. Word has length 54 [2025-04-13 19:00:06,108 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:06,108 INFO L485 AbstractCegarLoop]: Abstraction has 10253 states and 39411 transitions. [2025-04-13 19:00:06,108 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:06,108 INFO L278 IsEmpty]: Start isEmpty. Operand 10253 states and 39411 transitions. [2025-04-13 19:00:06,123 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:06,123 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:06,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:06,123 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable305 [2025-04-13 19:00:06,123 INFO L403 AbstractCegarLoop]: === Iteration 307 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:06,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:06,124 INFO L85 PathProgramCache]: Analyzing trace with hash -195626752, now seen corresponding path program 307 times [2025-04-13 19:00:06,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:06,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063367371] [2025-04-13 19:00:06,124 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:00:06,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:06,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:06,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:06,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:00:06,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:06,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063367371] [2025-04-13 19:00:06,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063367371] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:06,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:06,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:06,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120952252] [2025-04-13 19:00:06,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:06,744 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:06,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:06,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:06,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:06,744 INFO L87 Difference]: Start difference. First operand 10253 states and 39411 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:07,678 INFO L93 Difference]: Finished difference Result 19472 states and 71842 transitions. [2025-04-13 19:00:07,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 19:00:07,679 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:07,679 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:07,744 INFO L225 Difference]: With dead ends: 19472 [2025-04-13 19:00:07,745 INFO L226 Difference]: Without dead ends: 19348 [2025-04-13 19:00:07,751 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2025-04-13 19:00:07,751 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 289 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:07,751 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 522 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:07,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19348 states. [2025-04-13 19:00:07,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19348 to 10237. [2025-04-13 19:00:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10237 states, 10236 states have (on average 3.844763579523251) internal successors, (39355), 10236 states have internal predecessors, (39355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10237 states to 10237 states and 39355 transitions. [2025-04-13 19:00:08,000 INFO L79 Accepts]: Start accepts. Automaton has 10237 states and 39355 transitions. Word has length 54 [2025-04-13 19:00:08,000 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:08,000 INFO L485 AbstractCegarLoop]: Abstraction has 10237 states and 39355 transitions. [2025-04-13 19:00:08,000 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:08,001 INFO L278 IsEmpty]: Start isEmpty. Operand 10237 states and 39355 transitions. [2025-04-13 19:00:08,016 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:08,016 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:08,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:08,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306 [2025-04-13 19:00:08,016 INFO L403 AbstractCegarLoop]: === Iteration 308 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:08,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:08,017 INFO L85 PathProgramCache]: Analyzing trace with hash 664695508, now seen corresponding path program 308 times [2025-04-13 19:00:08,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:08,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725653506] [2025-04-13 19:00:08,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:00:08,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:08,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:08,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:08,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:00:08,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:08,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:08,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725653506] [2025-04-13 19:00:08,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725653506] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:08,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:08,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:08,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763035307] [2025-04-13 19:00:08,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:08,661 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:08,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:08,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:08,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:08,661 INFO L87 Difference]: Start difference. First operand 10237 states and 39355 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:09,607 INFO L93 Difference]: Finished difference Result 20676 states and 75756 transitions. [2025-04-13 19:00:09,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:00:09,607 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:09,608 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:09,670 INFO L225 Difference]: With dead ends: 20676 [2025-04-13 19:00:09,670 INFO L226 Difference]: Without dead ends: 20537 [2025-04-13 19:00:09,677 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=441, Unknown=0, NotChecked=0, Total=650 [2025-04-13 19:00:09,677 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 342 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:09,677 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 610 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20537 states. [2025-04-13 19:00:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20537 to 10215. [2025-04-13 19:00:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10215 states, 10214 states have (on average 3.845897787350695) internal successors, (39282), 10214 states have internal predecessors, (39282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:09,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10215 states to 10215 states and 39282 transitions. [2025-04-13 19:00:09,904 INFO L79 Accepts]: Start accepts. Automaton has 10215 states and 39282 transitions. Word has length 54 [2025-04-13 19:00:09,905 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:09,905 INFO L485 AbstractCegarLoop]: Abstraction has 10215 states and 39282 transitions. [2025-04-13 19:00:09,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:09,905 INFO L278 IsEmpty]: Start isEmpty. Operand 10215 states and 39282 transitions. [2025-04-13 19:00:09,920 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:09,920 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:09,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:09,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307 [2025-04-13 19:00:09,920 INFO L403 AbstractCegarLoop]: === Iteration 309 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:09,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:09,920 INFO L85 PathProgramCache]: Analyzing trace with hash -348938096, now seen corresponding path program 309 times [2025-04-13 19:00:09,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:09,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426990148] [2025-04-13 19:00:09,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:00:09,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:09,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:09,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:09,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:00:09,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:10,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:10,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426990148] [2025-04-13 19:00:10,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426990148] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:10,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:10,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:10,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385476359] [2025-04-13 19:00:10,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:10,539 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:10,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:10,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:10,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:10,539 INFO L87 Difference]: Start difference. First operand 10215 states and 39282 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:11,536 INFO L93 Difference]: Finished difference Result 19270 states and 71221 transitions. [2025-04-13 19:00:11,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:00:11,536 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:11,536 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:11,600 INFO L225 Difference]: With dead ends: 19270 [2025-04-13 19:00:11,601 INFO L226 Difference]: Without dead ends: 19200 [2025-04-13 19:00:11,607 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:00:11,607 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 297 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:11,607 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 645 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:00:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19200 states. [2025-04-13 19:00:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19200 to 10245. [2025-04-13 19:00:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10245 states, 10244 states have (on average 3.8439086294416245) internal successors, (39377), 10244 states have internal predecessors, (39377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 39377 transitions. [2025-04-13 19:00:11,843 INFO L79 Accepts]: Start accepts. Automaton has 10245 states and 39377 transitions. Word has length 54 [2025-04-13 19:00:11,843 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:11,843 INFO L485 AbstractCegarLoop]: Abstraction has 10245 states and 39377 transitions. [2025-04-13 19:00:11,843 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:11,843 INFO L278 IsEmpty]: Start isEmpty. Operand 10245 states and 39377 transitions. [2025-04-13 19:00:11,859 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:11,859 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:11,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] [2025-04-13 19:00:11,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable308 [2025-04-13 19:00:11,859 INFO L403 AbstractCegarLoop]: === Iteration 310 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:11,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:11,859 INFO L85 PathProgramCache]: Analyzing trace with hash 411708004, now seen corresponding path program 310 times [2025-04-13 19:00:11,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:11,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198084375] [2025-04-13 19:00:11,859 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:00:11,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:11,862 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:00:11,874 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:11,874 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:00:11,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:12,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:12,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198084375] [2025-04-13 19:00:12,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198084375] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:12,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:12,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:12,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102647837] [2025-04-13 19:00:12,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:12,470 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:12,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:12,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:12,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:12,471 INFO L87 Difference]: Start difference. First operand 10245 states and 39377 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:13,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:13,265 INFO L93 Difference]: Finished difference Result 20481 states and 75183 transitions. [2025-04-13 19:00:13,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:00:13,266 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:13,266 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:13,331 INFO L225 Difference]: With dead ends: 20481 [2025-04-13 19:00:13,331 INFO L226 Difference]: Without dead ends: 20417 [2025-04-13 19:00:13,337 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:00:13,337 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 314 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:13,337 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 510 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 19:00:13,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20417 states. [2025-04-13 19:00:13,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20417 to 10269. [2025-04-13 19:00:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10269 states, 10268 states have (on average 3.8423256719906504) internal successors, (39453), 10268 states have internal predecessors, (39453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10269 states to 10269 states and 39453 transitions. [2025-04-13 19:00:13,583 INFO L79 Accepts]: Start accepts. Automaton has 10269 states and 39453 transitions. Word has length 54 [2025-04-13 19:00:13,584 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:13,584 INFO L485 AbstractCegarLoop]: Abstraction has 10269 states and 39453 transitions. [2025-04-13 19:00:13,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:13,584 INFO L278 IsEmpty]: Start isEmpty. Operand 10269 states and 39453 transitions. [2025-04-13 19:00:13,599 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:13,600 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:13,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:13,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable309 [2025-04-13 19:00:13,600 INFO L403 AbstractCegarLoop]: === Iteration 311 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:13,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:13,600 INFO L85 PathProgramCache]: Analyzing trace with hash 571637870, now seen corresponding path program 311 times [2025-04-13 19:00:13,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:13,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500202048] [2025-04-13 19:00:13,600 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:00:13,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:13,603 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:13,615 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:13,615 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:00:13,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:14,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:14,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500202048] [2025-04-13 19:00:14,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500202048] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:14,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:14,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:14,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415039013] [2025-04-13 19:00:14,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:14,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:14,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:14,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:14,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:14,204 INFO L87 Difference]: Start difference. First operand 10269 states and 39453 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:15,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:15,136 INFO L93 Difference]: Finished difference Result 19292 states and 71282 transitions. [2025-04-13 19:00:15,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:00:15,136 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:15,136 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:15,202 INFO L225 Difference]: With dead ends: 19292 [2025-04-13 19:00:15,203 INFO L226 Difference]: Without dead ends: 19214 [2025-04-13 19:00:15,209 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:00:15,209 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 333 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:15,209 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 558 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19214 states. [2025-04-13 19:00:15,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19214 to 10259. [2025-04-13 19:00:15,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10259 states, 10258 states have (on average 3.8426593877948916) internal successors, (39418), 10258 states have internal predecessors, (39418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10259 states to 10259 states and 39418 transitions. [2025-04-13 19:00:15,494 INFO L79 Accepts]: Start accepts. Automaton has 10259 states and 39418 transitions. Word has length 54 [2025-04-13 19:00:15,495 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:15,495 INFO L485 AbstractCegarLoop]: Abstraction has 10259 states and 39418 transitions. [2025-04-13 19:00:15,495 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:15,495 INFO L278 IsEmpty]: Start isEmpty. Operand 10259 states and 39418 transitions. [2025-04-13 19:00:15,510 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:15,510 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:15,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] [2025-04-13 19:00:15,510 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable310 [2025-04-13 19:00:15,511 INFO L403 AbstractCegarLoop]: === Iteration 312 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:15,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:15,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1033862590, now seen corresponding path program 312 times [2025-04-13 19:00:15,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:15,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14824273] [2025-04-13 19:00:15,511 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:00:15,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:15,514 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:15,524 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:15,524 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:00:15,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:16,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:16,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:16,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14824273] [2025-04-13 19:00:16,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14824273] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:16,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:16,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:16,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12978079] [2025-04-13 19:00:16,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:16,170 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:16,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:16,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:16,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:16,170 INFO L87 Difference]: Start difference. First operand 10259 states and 39418 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:17,174 INFO L93 Difference]: Finished difference Result 20478 states and 75159 transitions. [2025-04-13 19:00:17,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:00:17,174 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:17,174 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:17,240 INFO L225 Difference]: With dead ends: 20478 [2025-04-13 19:00:17,240 INFO L226 Difference]: Without dead ends: 20399 [2025-04-13 19:00:17,247 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:00:17,247 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 316 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:17,247 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 593 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:00:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20399 states. [2025-04-13 19:00:17,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20399 to 10251. [2025-04-13 19:00:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10251 states, 10250 states have (on average 3.8429268292682925) internal successors, (39390), 10250 states have internal predecessors, (39390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10251 states to 10251 states and 39390 transitions. [2025-04-13 19:00:17,589 INFO L79 Accepts]: Start accepts. Automaton has 10251 states and 39390 transitions. Word has length 54 [2025-04-13 19:00:17,589 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:17,589 INFO L485 AbstractCegarLoop]: Abstraction has 10251 states and 39390 transitions. [2025-04-13 19:00:17,589 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:17,589 INFO L278 IsEmpty]: Start isEmpty. Operand 10251 states and 39390 transitions. [2025-04-13 19:00:17,608 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:17,608 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:17,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:17,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2025-04-13 19:00:17,608 INFO L403 AbstractCegarLoop]: === Iteration 313 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:17,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:17,609 INFO L85 PathProgramCache]: Analyzing trace with hash -947400928, now seen corresponding path program 313 times [2025-04-13 19:00:17,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:17,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698731200] [2025-04-13 19:00:17,609 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:00:17,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:17,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:17,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:17,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:00:17,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:18,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:18,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698731200] [2025-04-13 19:00:18,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698731200] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:18,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:18,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:18,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993402857] [2025-04-13 19:00:18,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:18,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:18,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:18,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:18,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:18,267 INFO L87 Difference]: Start difference. First operand 10251 states and 39390 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:19,165 INFO L93 Difference]: Finished difference Result 19246 states and 71166 transitions. [2025-04-13 19:00:19,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:00:19,166 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:19,166 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:19,233 INFO L225 Difference]: With dead ends: 19246 [2025-04-13 19:00:19,233 INFO L226 Difference]: Without dead ends: 19110 [2025-04-13 19:00:19,239 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:00:19,239 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 278 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:19,239 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 598 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19110 states. [2025-04-13 19:00:19,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19110 to 10223. [2025-04-13 19:00:19,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10223 states, 10222 states have (on average 3.8448444531402854) internal successors, (39302), 10222 states have internal predecessors, (39302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10223 states to 10223 states and 39302 transitions. [2025-04-13 19:00:19,473 INFO L79 Accepts]: Start accepts. Automaton has 10223 states and 39302 transitions. Word has length 54 [2025-04-13 19:00:19,474 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:19,474 INFO L485 AbstractCegarLoop]: Abstraction has 10223 states and 39302 transitions. [2025-04-13 19:00:19,474 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:19,474 INFO L278 IsEmpty]: Start isEmpty. Operand 10223 states and 39302 transitions. [2025-04-13 19:00:19,489 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:19,489 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:19,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:19,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2025-04-13 19:00:19,489 INFO L403 AbstractCegarLoop]: === Iteration 314 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:19,489 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1416469684, now seen corresponding path program 314 times [2025-04-13 19:00:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:19,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558060474] [2025-04-13 19:00:19,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:00:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:19,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:19,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:19,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:00:19,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:20,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:20,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558060474] [2025-04-13 19:00:20,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558060474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:20,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:20,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:20,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381116623] [2025-04-13 19:00:20,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:20,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:20,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:20,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:20,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:20,133 INFO L87 Difference]: Start difference. First operand 10223 states and 39302 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:21,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:21,055 INFO L93 Difference]: Finished difference Result 20417 states and 74997 transitions. [2025-04-13 19:00:21,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:00:21,055 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:21,055 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:21,120 INFO L225 Difference]: With dead ends: 20417 [2025-04-13 19:00:21,120 INFO L226 Difference]: Without dead ends: 20276 [2025-04-13 19:00:21,127 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:00:21,127 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 318 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:21,127 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 569 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20276 states. [2025-04-13 19:00:21,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20276 to 10199. [2025-04-13 19:00:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10199 states, 10198 states have (on average 3.846440478525201) internal successors, (39226), 10198 states have internal predecessors, (39226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10199 states to 10199 states and 39226 transitions. [2025-04-13 19:00:21,368 INFO L79 Accepts]: Start accepts. Automaton has 10199 states and 39226 transitions. Word has length 54 [2025-04-13 19:00:21,368 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:21,368 INFO L485 AbstractCegarLoop]: Abstraction has 10199 states and 39226 transitions. [2025-04-13 19:00:21,368 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:21,368 INFO L278 IsEmpty]: Start isEmpty. Operand 10199 states and 39226 transitions. [2025-04-13 19:00:21,383 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:21,383 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:21,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] [2025-04-13 19:00:21,383 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable313 [2025-04-13 19:00:21,383 INFO L403 AbstractCegarLoop]: === Iteration 315 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:21,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:21,383 INFO L85 PathProgramCache]: Analyzing trace with hash 942773408, now seen corresponding path program 315 times [2025-04-13 19:00:21,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:21,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492935244] [2025-04-13 19:00:21,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:00:21,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:21,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:21,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:21,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:00:21,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:22,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:22,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492935244] [2025-04-13 19:00:22,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492935244] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:22,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:22,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:22,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819015449] [2025-04-13 19:00:22,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:22,019 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:22,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:22,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:22,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:22,019 INFO L87 Difference]: Start difference. First operand 10199 states and 39226 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:22,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:22,961 INFO L93 Difference]: Finished difference Result 19298 states and 71315 transitions. [2025-04-13 19:00:22,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:22,961 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:22,961 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:23,024 INFO L225 Difference]: With dead ends: 19298 [2025-04-13 19:00:23,024 INFO L226 Difference]: Without dead ends: 19186 [2025-04-13 19:00:23,030 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:23,030 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 318 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:23,030 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 572 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:23,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19186 states. [2025-04-13 19:00:23,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19186 to 10287. [2025-04-13 19:00:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10287 states, 10286 states have (on average 3.8403655454015166) internal successors, (39502), 10286 states have internal predecessors, (39502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10287 states to 10287 states and 39502 transitions. [2025-04-13 19:00:23,271 INFO L79 Accepts]: Start accepts. Automaton has 10287 states and 39502 transitions. Word has length 54 [2025-04-13 19:00:23,271 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:23,271 INFO L485 AbstractCegarLoop]: Abstraction has 10287 states and 39502 transitions. [2025-04-13 19:00:23,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:23,271 INFO L278 IsEmpty]: Start isEmpty. Operand 10287 states and 39502 transitions. [2025-04-13 19:00:23,288 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:23,288 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:23,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:23,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable314 [2025-04-13 19:00:23,289 INFO L403 AbstractCegarLoop]: === Iteration 316 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:23,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:23,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1857230284, now seen corresponding path program 316 times [2025-04-13 19:00:23,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:23,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288561239] [2025-04-13 19:00:23,289 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:00:23,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:23,291 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:00:23,301 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:23,301 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:00:23,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:23,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:23,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288561239] [2025-04-13 19:00:23,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288561239] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:23,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:23,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:23,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468120583] [2025-04-13 19:00:23,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:23,959 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:23,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:23,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:23,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:23,959 INFO L87 Difference]: Start difference. First operand 10287 states and 39502 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:24,859 INFO L93 Difference]: Finished difference Result 20627 states and 75650 transitions. [2025-04-13 19:00:24,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:24,859 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:24,859 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:24,925 INFO L225 Difference]: With dead ends: 20627 [2025-04-13 19:00:24,925 INFO L226 Difference]: Without dead ends: 20491 [2025-04-13 19:00:24,932 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:24,932 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 337 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:24,932 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 547 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:24,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20491 states. [2025-04-13 19:00:25,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20491 to 10408. [2025-04-13 19:00:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10408 states, 10407 states have (on average 3.8316517728452) internal successors, (39876), 10407 states have internal predecessors, (39876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:25,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10408 states to 10408 states and 39876 transitions. [2025-04-13 19:00:25,181 INFO L79 Accepts]: Start accepts. Automaton has 10408 states and 39876 transitions. Word has length 54 [2025-04-13 19:00:25,181 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:25,181 INFO L485 AbstractCegarLoop]: Abstraction has 10408 states and 39876 transitions. [2025-04-13 19:00:25,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:25,181 INFO L278 IsEmpty]: Start isEmpty. Operand 10408 states and 39876 transitions. [2025-04-13 19:00:25,197 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:25,197 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:25,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:25,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable315 [2025-04-13 19:00:25,197 INFO L403 AbstractCegarLoop]: === Iteration 317 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:25,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:25,197 INFO L85 PathProgramCache]: Analyzing trace with hash -762695486, now seen corresponding path program 317 times [2025-04-13 19:00:25,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:25,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735344710] [2025-04-13 19:00:25,197 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:00:25,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:25,200 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:25,212 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:25,212 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:00:25,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:25,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 19:00:25,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:25,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735344710] [2025-04-13 19:00:25,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735344710] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:25,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:25,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:25,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018196650] [2025-04-13 19:00:25,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:25,779 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:25,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:25,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:25,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:25,779 INFO L87 Difference]: Start difference. First operand 10408 states and 39876 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:26,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:26,805 INFO L93 Difference]: Finished difference Result 19447 states and 71722 transitions. [2025-04-13 19:00:26,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:26,806 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:26,806 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:26,872 INFO L225 Difference]: With dead ends: 19447 [2025-04-13 19:00:26,872 INFO L226 Difference]: Without dead ends: 19383 [2025-04-13 19:00:26,876 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:26,876 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 320 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:26,876 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 585 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:00:26,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19383 states. [2025-04-13 19:00:27,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19383 to 10416. [2025-04-13 19:00:27,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10416 states, 10415 states have (on average 3.8306289006240997) internal successors, (39896), 10415 states have internal predecessors, (39896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10416 states to 10416 states and 39896 transitions. [2025-04-13 19:00:27,114 INFO L79 Accepts]: Start accepts. Automaton has 10416 states and 39896 transitions. Word has length 54 [2025-04-13 19:00:27,114 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:27,114 INFO L485 AbstractCegarLoop]: Abstraction has 10416 states and 39896 transitions. [2025-04-13 19:00:27,114 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:27,114 INFO L278 IsEmpty]: Start isEmpty. Operand 10416 states and 39896 transitions. [2025-04-13 19:00:27,129 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:27,130 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:27,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:27,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable316 [2025-04-13 19:00:27,130 INFO L403 AbstractCegarLoop]: === Iteration 318 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:27,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:27,130 INFO L85 PathProgramCache]: Analyzing trace with hash 732268118, now seen corresponding path program 318 times [2025-04-13 19:00:27,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:27,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15022463] [2025-04-13 19:00:27,130 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:00:27,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:27,133 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:27,142 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:27,143 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:00:27,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:27,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:27,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15022463] [2025-04-13 19:00:27,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15022463] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:27,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:27,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:27,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845711862] [2025-04-13 19:00:27,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:27,722 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:27,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:27,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:27,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:27,722 INFO L87 Difference]: Start difference. First operand 10416 states and 39896 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:28,676 INFO L93 Difference]: Finished difference Result 20651 states and 75660 transitions. [2025-04-13 19:00:28,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:28,677 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:28,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:28,746 INFO L225 Difference]: With dead ends: 20651 [2025-04-13 19:00:28,746 INFO L226 Difference]: Without dead ends: 20581 [2025-04-13 19:00:28,752 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:28,752 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 316 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:28,752 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 581 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:28,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20581 states. [2025-04-13 19:00:29,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20581 to 10427. [2025-04-13 19:00:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10427 states, 10426 states have (on average 3.8291770573566084) internal successors, (39923), 10426 states have internal predecessors, (39923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10427 states to 10427 states and 39923 transitions. [2025-04-13 19:00:29,067 INFO L79 Accepts]: Start accepts. Automaton has 10427 states and 39923 transitions. Word has length 54 [2025-04-13 19:00:29,068 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:29,068 INFO L485 AbstractCegarLoop]: Abstraction has 10427 states and 39923 transitions. [2025-04-13 19:00:29,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:29,068 INFO L278 IsEmpty]: Start isEmpty. Operand 10427 states and 39923 transitions. [2025-04-13 19:00:29,083 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:29,083 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:29,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:29,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable317 [2025-04-13 19:00:29,083 INFO L403 AbstractCegarLoop]: === Iteration 319 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:29,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1122290848, now seen corresponding path program 319 times [2025-04-13 19:00:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:29,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991493358] [2025-04-13 19:00:29,084 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:00:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:29,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:29,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:29,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:00:29,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:29,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:29,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991493358] [2025-04-13 19:00:29,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991493358] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:29,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:29,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:29,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315528871] [2025-04-13 19:00:29,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:29,672 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:29,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:29,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:29,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:29,672 INFO L87 Difference]: Start difference. First operand 10427 states and 39923 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:30,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:30,590 INFO L93 Difference]: Finished difference Result 19394 states and 71580 transitions. [2025-04-13 19:00:30,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:30,590 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:30,590 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:30,658 INFO L225 Difference]: With dead ends: 19394 [2025-04-13 19:00:30,658 INFO L226 Difference]: Without dead ends: 19294 [2025-04-13 19:00:30,664 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:30,664 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 306 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:30,664 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 537 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:30,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19294 states. [2025-04-13 19:00:30,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19294 to 10395. [2025-04-13 19:00:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10395 states, 10394 states have (on average 3.8309601693284585) internal successors, (39819), 10394 states have internal predecessors, (39819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10395 states to 10395 states and 39819 transitions. [2025-04-13 19:00:30,910 INFO L79 Accepts]: Start accepts. Automaton has 10395 states and 39819 transitions. Word has length 54 [2025-04-13 19:00:30,910 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:30,910 INFO L485 AbstractCegarLoop]: Abstraction has 10395 states and 39819 transitions. [2025-04-13 19:00:30,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:30,910 INFO L278 IsEmpty]: Start isEmpty. Operand 10395 states and 39819 transitions. [2025-04-13 19:00:30,926 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:30,926 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:30,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:30,926 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable318 [2025-04-13 19:00:30,926 INFO L403 AbstractCegarLoop]: === Iteration 320 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:30,927 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:30,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1677712844, now seen corresponding path program 320 times [2025-04-13 19:00:30,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:30,927 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442907591] [2025-04-13 19:00:30,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:00:30,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:30,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:30,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:30,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:00:30,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:31,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:31,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442907591] [2025-04-13 19:00:31,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442907591] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:31,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:31,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:31,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966664185] [2025-04-13 19:00:31,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:31,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:31,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:31,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:31,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:31,581 INFO L87 Difference]: Start difference. First operand 10395 states and 39819 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:32,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:32,469 INFO L93 Difference]: Finished difference Result 20549 states and 75367 transitions. [2025-04-13 19:00:32,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:32,470 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:32,470 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:32,538 INFO L225 Difference]: With dead ends: 20549 [2025-04-13 19:00:32,538 INFO L226 Difference]: Without dead ends: 20434 [2025-04-13 19:00:32,548 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:32,548 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 332 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:32,548 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 506 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20434 states. [2025-04-13 19:00:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20434 to 10351. [2025-04-13 19:00:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10351 states, 10350 states have (on average 3.833623188405797) internal successors, (39678), 10350 states have internal predecessors, (39678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10351 states to 10351 states and 39678 transitions. [2025-04-13 19:00:32,804 INFO L79 Accepts]: Start accepts. Automaton has 10351 states and 39678 transitions. Word has length 54 [2025-04-13 19:00:32,804 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:32,805 INFO L485 AbstractCegarLoop]: Abstraction has 10351 states and 39678 transitions. [2025-04-13 19:00:32,805 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:32,805 INFO L278 IsEmpty]: Start isEmpty. Operand 10351 states and 39678 transitions. [2025-04-13 19:00:32,820 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:32,821 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:32,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:32,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable319 [2025-04-13 19:00:32,821 INFO L403 AbstractCegarLoop]: === Iteration 321 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:32,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1008901074, now seen corresponding path program 321 times [2025-04-13 19:00:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:32,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114139756] [2025-04-13 19:00:32,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:00:32,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:32,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:32,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:32,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:00:32,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:33,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:33,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114139756] [2025-04-13 19:00:33,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114139756] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:33,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:33,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:33,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107789012] [2025-04-13 19:00:33,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:33,449 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:33,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:33,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:33,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:33,449 INFO L87 Difference]: Start difference. First operand 10351 states and 39678 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:34,321 INFO L93 Difference]: Finished difference Result 19338 states and 71395 transitions. [2025-04-13 19:00:34,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:34,321 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:34,321 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:34,384 INFO L225 Difference]: With dead ends: 19338 [2025-04-13 19:00:34,385 INFO L226 Difference]: Without dead ends: 19274 [2025-04-13 19:00:34,391 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:34,391 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 314 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:34,391 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 503 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:34,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19274 states. [2025-04-13 19:00:34,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19274 to 10375. [2025-04-13 19:00:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10375 states, 10374 states have (on average 3.8320802005012533) internal successors, (39754), 10374 states have internal predecessors, (39754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10375 states to 10375 states and 39754 transitions. [2025-04-13 19:00:34,628 INFO L79 Accepts]: Start accepts. Automaton has 10375 states and 39754 transitions. Word has length 54 [2025-04-13 19:00:34,628 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:34,628 INFO L485 AbstractCegarLoop]: Abstraction has 10375 states and 39754 transitions. [2025-04-13 19:00:34,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:34,628 INFO L278 IsEmpty]: Start isEmpty. Operand 10375 states and 39754 transitions. [2025-04-13 19:00:34,643 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:34,643 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:34,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:34,644 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable320 [2025-04-13 19:00:34,644 INFO L403 AbstractCegarLoop]: === Iteration 322 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:34,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:34,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1791102618, now seen corresponding path program 322 times [2025-04-13 19:00:34,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:34,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51262129] [2025-04-13 19:00:34,644 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:00:34,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:34,646 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:00:34,657 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:34,657 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:00:34,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:35,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 19:00:35,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:35,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51262129] [2025-04-13 19:00:35,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51262129] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:35,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:35,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:35,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824692093] [2025-04-13 19:00:35,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:35,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:35,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:35,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:35,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:35,240 INFO L87 Difference]: Start difference. First operand 10375 states and 39754 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:36,200 INFO L93 Difference]: Finished difference Result 20552 states and 75369 transitions. [2025-04-13 19:00:36,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:36,200 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:36,200 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:36,271 INFO L225 Difference]: With dead ends: 20552 [2025-04-13 19:00:36,271 INFO L226 Difference]: Without dead ends: 20482 [2025-04-13 19:00:36,279 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:36,279 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 334 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:36,279 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 534 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:36,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20482 states. [2025-04-13 19:00:36,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20482 to 10408. [2025-04-13 19:00:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10408 states, 10407 states have (on average 3.8298260786009415) internal successors, (39857), 10407 states have internal predecessors, (39857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10408 states to 10408 states and 39857 transitions. [2025-04-13 19:00:36,526 INFO L79 Accepts]: Start accepts. Automaton has 10408 states and 39857 transitions. Word has length 54 [2025-04-13 19:00:36,526 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:36,526 INFO L485 AbstractCegarLoop]: Abstraction has 10408 states and 39857 transitions. [2025-04-13 19:00:36,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:36,526 INFO L278 IsEmpty]: Start isEmpty. Operand 10408 states and 39857 transitions. [2025-04-13 19:00:36,542 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:36,542 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:36,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:36,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable321 [2025-04-13 19:00:36,542 INFO L403 AbstractCegarLoop]: === Iteration 323 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:36,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:36,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1401079888, now seen corresponding path program 323 times [2025-04-13 19:00:36,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:36,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768667181] [2025-04-13 19:00:36,543 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:00:36,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:36,545 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:36,556 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:36,556 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:00:36,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:37,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:37,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768667181] [2025-04-13 19:00:37,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768667181] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:37,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:37,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:37,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637456420] [2025-04-13 19:00:37,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:37,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:37,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:37,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:37,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:37,116 INFO L87 Difference]: Start difference. First operand 10408 states and 39857 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:38,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:38,005 INFO L93 Difference]: Finished difference Result 19375 states and 71502 transitions. [2025-04-13 19:00:38,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:38,006 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:38,006 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:38,072 INFO L225 Difference]: With dead ends: 19375 [2025-04-13 19:00:38,072 INFO L226 Difference]: Without dead ends: 19299 [2025-04-13 19:00:38,078 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:38,078 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 333 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:38,078 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 494 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19299 states. [2025-04-13 19:00:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19299 to 10400. [2025-04-13 19:00:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10400 states, 10399 states have (on average 3.830079815366862) internal successors, (39829), 10399 states have internal predecessors, (39829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10400 states to 10400 states and 39829 transitions. [2025-04-13 19:00:38,371 INFO L79 Accepts]: Start accepts. Automaton has 10400 states and 39829 transitions. Word has length 54 [2025-04-13 19:00:38,371 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:38,371 INFO L485 AbstractCegarLoop]: Abstraction has 10400 states and 39829 transitions. [2025-04-13 19:00:38,371 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:38,372 INFO L278 IsEmpty]: Start isEmpty. Operand 10400 states and 39829 transitions. [2025-04-13 19:00:38,387 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:38,388 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:38,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:38,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable322 [2025-04-13 19:00:38,388 INFO L403 AbstractCegarLoop]: === Iteration 324 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:38,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:38,388 INFO L85 PathProgramCache]: Analyzing trace with hash 93883716, now seen corresponding path program 324 times [2025-04-13 19:00:38,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:38,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062672029] [2025-04-13 19:00:38,388 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:00:38,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:38,391 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:38,401 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:38,401 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:00:38,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:38,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:38,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062672029] [2025-04-13 19:00:38,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062672029] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:38,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:38,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:38,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68513756] [2025-04-13 19:00:38,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:38,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:38,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:38,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:38,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:38,993 INFO L87 Difference]: Start difference. First operand 10400 states and 39829 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:39,946 INFO L93 Difference]: Finished difference Result 20545 states and 75332 transitions. [2025-04-13 19:00:39,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:39,947 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:39,947 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:40,017 INFO L225 Difference]: With dead ends: 20545 [2025-04-13 19:00:40,017 INFO L226 Difference]: Without dead ends: 20463 [2025-04-13 19:00:40,024 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:40,025 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 316 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:40,025 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 598 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:40,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20463 states. [2025-04-13 19:00:40,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20463 to 10389. [2025-04-13 19:00:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10389 states, 10388 states have (on average 3.8304774740084713) internal successors, (39791), 10388 states have internal predecessors, (39791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10389 states to 10389 states and 39791 transitions. [2025-04-13 19:00:40,279 INFO L79 Accepts]: Start accepts. Automaton has 10389 states and 39791 transitions. Word has length 54 [2025-04-13 19:00:40,279 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:40,279 INFO L485 AbstractCegarLoop]: Abstraction has 10389 states and 39791 transitions. [2025-04-13 19:00:40,279 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:40,279 INFO L278 IsEmpty]: Start isEmpty. Operand 10389 states and 39791 transitions. [2025-04-13 19:00:40,294 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:40,295 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:40,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:40,295 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable323 [2025-04-13 19:00:40,295 INFO L403 AbstractCegarLoop]: === Iteration 325 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:40,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:40,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1212050498, now seen corresponding path program 325 times [2025-04-13 19:00:40,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:40,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102681731] [2025-04-13 19:00:40,295 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:00:40,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:40,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:40,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:40,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:00:40,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:40,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:40,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102681731] [2025-04-13 19:00:40,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102681731] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:40,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:40,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:40,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526919485] [2025-04-13 19:00:40,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:40,883 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:40,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:40,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:40,884 INFO L87 Difference]: Start difference. First operand 10389 states and 39791 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:41,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:41,754 INFO L93 Difference]: Finished difference Result 19288 states and 71263 transitions. [2025-04-13 19:00:41,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:41,754 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:41,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:41,817 INFO L225 Difference]: With dead ends: 19288 [2025-04-13 19:00:41,817 INFO L226 Difference]: Without dead ends: 19044 [2025-04-13 19:00:41,823 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:41,823 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 280 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:41,823 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 543 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19044 states. [2025-04-13 19:00:41,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19044 to 10253. [2025-04-13 19:00:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10253 states, 10252 states have (on average 3.8407140070230197) internal successors, (39375), 10252 states have internal predecessors, (39375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:42,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10253 states to 10253 states and 39375 transitions. [2025-04-13 19:00:42,064 INFO L79 Accepts]: Start accepts. Automaton has 10253 states and 39375 transitions. Word has length 54 [2025-04-13 19:00:42,064 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:42,064 INFO L485 AbstractCegarLoop]: Abstraction has 10253 states and 39375 transitions. [2025-04-13 19:00:42,064 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:42,064 INFO L278 IsEmpty]: Start isEmpty. Operand 10253 states and 39375 transitions. [2025-04-13 19:00:42,080 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:42,081 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:42,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:42,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable324 [2025-04-13 19:00:42,081 INFO L403 AbstractCegarLoop]: === Iteration 326 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:42,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:42,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1587953194, now seen corresponding path program 326 times [2025-04-13 19:00:42,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:42,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501965593] [2025-04-13 19:00:42,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:00:42,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:42,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:42,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:42,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:00:42,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:42,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:42,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501965593] [2025-04-13 19:00:42,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501965593] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:42,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:42,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:42,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381260600] [2025-04-13 19:00:42,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:42,692 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:42,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:42,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:42,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:42,693 INFO L87 Difference]: Start difference. First operand 10253 states and 39375 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:43,573 INFO L93 Difference]: Finished difference Result 20327 states and 74698 transitions. [2025-04-13 19:00:43,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:43,573 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:43,574 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:43,642 INFO L225 Difference]: With dead ends: 20327 [2025-04-13 19:00:43,642 INFO L226 Difference]: Without dead ends: 20036 [2025-04-13 19:00:43,650 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:43,650 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 313 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:43,650 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 506 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20036 states. [2025-04-13 19:00:43,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20036 to 10079. [2025-04-13 19:00:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10079 states, 10078 states have (on average 3.855328438182179) internal successors, (38854), 10078 states have internal predecessors, (38854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10079 states to 10079 states and 38854 transitions. [2025-04-13 19:00:43,896 INFO L79 Accepts]: Start accepts. Automaton has 10079 states and 38854 transitions. Word has length 54 [2025-04-13 19:00:43,897 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:43,897 INFO L485 AbstractCegarLoop]: Abstraction has 10079 states and 38854 transitions. [2025-04-13 19:00:43,897 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:43,897 INFO L278 IsEmpty]: Start isEmpty. Operand 10079 states and 38854 transitions. [2025-04-13 19:00:43,912 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:43,912 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:43,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:43,912 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable325 [2025-04-13 19:00:43,912 INFO L403 AbstractCegarLoop]: === Iteration 327 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:43,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:43,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1785045790, now seen corresponding path program 327 times [2025-04-13 19:00:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:43,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530676081] [2025-04-13 19:00:43,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:00:43,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:43,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:43,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:43,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:00:43,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:44,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:44,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530676081] [2025-04-13 19:00:44,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530676081] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:44,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:44,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:44,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769794334] [2025-04-13 19:00:44,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:44,473 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:44,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:44,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:44,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:44,473 INFO L87 Difference]: Start difference. First operand 10079 states and 38854 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:45,404 INFO L93 Difference]: Finished difference Result 18678 states and 69318 transitions. [2025-04-13 19:00:45,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:45,405 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:45,405 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:45,466 INFO L225 Difference]: With dead ends: 18678 [2025-04-13 19:00:45,467 INFO L226 Difference]: Without dead ends: 18566 [2025-04-13 19:00:45,474 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:45,474 INFO L437 NwaCegarLoop]: 119 mSDtfsCounter, 294 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:45,474 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 608 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:45,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18566 states. [2025-04-13 19:00:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18566 to 10239. [2025-04-13 19:00:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10239 states, 10238 states have (on average 3.8443055284235204) internal successors, (39358), 10238 states have internal predecessors, (39358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10239 states to 10239 states and 39358 transitions. [2025-04-13 19:00:45,705 INFO L79 Accepts]: Start accepts. Automaton has 10239 states and 39358 transitions. Word has length 54 [2025-04-13 19:00:45,705 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:45,705 INFO L485 AbstractCegarLoop]: Abstraction has 10239 states and 39358 transitions. [2025-04-13 19:00:45,705 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:45,706 INFO L278 IsEmpty]: Start isEmpty. Operand 10239 states and 39358 transitions. [2025-04-13 19:00:45,721 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:45,721 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:45,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:45,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable326 [2025-04-13 19:00:45,721 INFO L403 AbstractCegarLoop]: === Iteration 328 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:45,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:45,721 INFO L85 PathProgramCache]: Analyzing trace with hash -383732494, now seen corresponding path program 328 times [2025-04-13 19:00:45,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:45,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765892211] [2025-04-13 19:00:45,721 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:00:45,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:45,724 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:00:45,733 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:45,733 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:00:45,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:46,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:46,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765892211] [2025-04-13 19:00:46,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765892211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:46,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:46,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:46,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420243664] [2025-04-13 19:00:46,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:46,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:46,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:46,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:46,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:46,362 INFO L87 Difference]: Start difference. First operand 10239 states and 39358 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:47,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:47,321 INFO L93 Difference]: Finished difference Result 20028 states and 73731 transitions. [2025-04-13 19:00:47,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:47,321 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:47,321 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:47,391 INFO L225 Difference]: With dead ends: 20028 [2025-04-13 19:00:47,391 INFO L226 Difference]: Without dead ends: 19892 [2025-04-13 19:00:47,398 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:47,398 INFO L437 NwaCegarLoop]: 119 mSDtfsCounter, 304 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:47,398 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 639 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:00:47,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19892 states. [2025-04-13 19:00:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19892 to 10480. [2025-04-13 19:00:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10480 states, 10479 states have (on average 3.826319305277221) internal successors, (40096), 10479 states have internal predecessors, (40096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10480 states to 10480 states and 40096 transitions. [2025-04-13 19:00:47,724 INFO L79 Accepts]: Start accepts. Automaton has 10480 states and 40096 transitions. Word has length 54 [2025-04-13 19:00:47,725 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:47,725 INFO L485 AbstractCegarLoop]: Abstraction has 10480 states and 40096 transitions. [2025-04-13 19:00:47,725 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:47,725 INFO L278 IsEmpty]: Start isEmpty. Operand 10480 states and 40096 transitions. [2025-04-13 19:00:47,741 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:47,741 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:47,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] [2025-04-13 19:00:47,741 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable327 [2025-04-13 19:00:47,741 INFO L403 AbstractCegarLoop]: === Iteration 329 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:47,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:47,742 INFO L85 PathProgramCache]: Analyzing trace with hash -401583330, now seen corresponding path program 329 times [2025-04-13 19:00:47,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:47,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964064795] [2025-04-13 19:00:47,742 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:00:47,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:47,745 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:47,755 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:47,755 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:00:47,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:48,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:48,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964064795] [2025-04-13 19:00:48,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964064795] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:48,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:48,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:48,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330912023] [2025-04-13 19:00:48,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:48,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:48,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:48,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:48,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:48,311 INFO L87 Difference]: Start difference. First operand 10480 states and 40096 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:49,218 INFO L93 Difference]: Finished difference Result 18947 states and 70089 transitions. [2025-04-13 19:00:49,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:49,218 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:49,218 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:49,283 INFO L225 Difference]: With dead ends: 18947 [2025-04-13 19:00:49,284 INFO L226 Difference]: Without dead ends: 18883 [2025-04-13 19:00:49,290 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:49,290 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 295 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 1541 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:49,290 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 641 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1541 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:49,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18883 states. [2025-04-13 19:00:49,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18883 to 10488. [2025-04-13 19:00:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10488 states, 10487 states have (on average 3.8253075236006486) internal successors, (40116), 10487 states have internal predecessors, (40116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10488 states to 10488 states and 40116 transitions. [2025-04-13 19:00:49,532 INFO L79 Accepts]: Start accepts. Automaton has 10488 states and 40116 transitions. Word has length 54 [2025-04-13 19:00:49,533 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:49,533 INFO L485 AbstractCegarLoop]: Abstraction has 10488 states and 40116 transitions. [2025-04-13 19:00:49,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:49,533 INFO L278 IsEmpty]: Start isEmpty. Operand 10488 states and 40116 transitions. [2025-04-13 19:00:49,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:49,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:49,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] [2025-04-13 19:00:49,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable328 [2025-04-13 19:00:49,549 INFO L403 AbstractCegarLoop]: === Iteration 330 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:49,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:49,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1724605682, now seen corresponding path program 330 times [2025-04-13 19:00:49,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:49,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971498349] [2025-04-13 19:00:49,550 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:00:49,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:49,552 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:49,561 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:49,561 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:00:49,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:50,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 19:00:50,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:50,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971498349] [2025-04-13 19:00:50,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971498349] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:50,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:50,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:50,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486187471] [2025-04-13 19:00:50,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:50,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:50,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:50,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:50,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:50,150 INFO L87 Difference]: Start difference. First operand 10488 states and 40116 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:51,032 INFO L93 Difference]: Finished difference Result 20052 states and 73741 transitions. [2025-04-13 19:00:51,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:51,033 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:51,033 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:51,102 INFO L225 Difference]: With dead ends: 20052 [2025-04-13 19:00:51,102 INFO L226 Difference]: Without dead ends: 19982 [2025-04-13 19:00:51,108 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:51,108 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 351 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:51,108 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 586 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19982 states. [2025-04-13 19:00:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19982 to 10499. [2025-04-13 19:00:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10499 states, 10498 states have (on average 3.8238712135644883) internal successors, (40143), 10498 states have internal predecessors, (40143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10499 states to 10499 states and 40143 transitions. [2025-04-13 19:00:51,364 INFO L79 Accepts]: Start accepts. Automaton has 10499 states and 40143 transitions. Word has length 54 [2025-04-13 19:00:51,364 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:51,364 INFO L485 AbstractCegarLoop]: Abstraction has 10499 states and 40143 transitions. [2025-04-13 19:00:51,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:51,364 INFO L278 IsEmpty]: Start isEmpty. Operand 10499 states and 40143 transitions. [2025-04-13 19:00:51,380 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:51,380 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:51,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:51,380 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable329 [2025-04-13 19:00:51,380 INFO L403 AbstractCegarLoop]: === Iteration 331 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:51,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:51,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1172061312, now seen corresponding path program 331 times [2025-04-13 19:00:51,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:51,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928231828] [2025-04-13 19:00:51,381 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:00:51,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:51,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:51,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:51,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:00:51,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:52,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:52,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928231828] [2025-04-13 19:00:52,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928231828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:52,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:52,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:52,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235214158] [2025-04-13 19:00:52,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:52,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:52,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:52,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:52,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:52,005 INFO L87 Difference]: Start difference. First operand 10499 states and 40143 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:52,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:52,926 INFO L93 Difference]: Finished difference Result 18894 states and 69947 transitions. [2025-04-13 19:00:52,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:00:52,926 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:52,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:52,990 INFO L225 Difference]: With dead ends: 18894 [2025-04-13 19:00:52,990 INFO L226 Difference]: Without dead ends: 18794 [2025-04-13 19:00:52,996 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:00:52,996 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 283 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:52,996 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 572 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18794 states. [2025-04-13 19:00:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18794 to 10467. [2025-04-13 19:00:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10467 states, 10466 states have (on average 3.825625836040512) internal successors, (40039), 10466 states have internal predecessors, (40039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10467 states to 10467 states and 40039 transitions. [2025-04-13 19:00:53,237 INFO L79 Accepts]: Start accepts. Automaton has 10467 states and 40039 transitions. Word has length 54 [2025-04-13 19:00:53,238 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:53,238 INFO L485 AbstractCegarLoop]: Abstraction has 10467 states and 40039 transitions. [2025-04-13 19:00:53,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:53,238 INFO L278 IsEmpty]: Start isEmpty. Operand 10467 states and 40039 transitions. [2025-04-13 19:00:53,254 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:53,254 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:53,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:53,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330 [2025-04-13 19:00:53,254 INFO L403 AbstractCegarLoop]: === Iteration 332 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:53,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:53,254 INFO L85 PathProgramCache]: Analyzing trace with hash 954127700, now seen corresponding path program 332 times [2025-04-13 19:00:53,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:53,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673329558] [2025-04-13 19:00:53,254 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:00:53,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:53,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:53,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:53,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:00:53,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:53,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:53,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673329558] [2025-04-13 19:00:53,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673329558] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:53,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:53,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:53,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362979813] [2025-04-13 19:00:53,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:53,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:53,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:53,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:53,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:53,882 INFO L87 Difference]: Start difference. First operand 10467 states and 40039 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:54,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:54,816 INFO L93 Difference]: Finished difference Result 19950 states and 73448 transitions. [2025-04-13 19:00:54,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:00:54,816 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:54,816 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:54,885 INFO L225 Difference]: With dead ends: 19950 [2025-04-13 19:00:54,885 INFO L226 Difference]: Without dead ends: 19835 [2025-04-13 19:00:54,892 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:00:54,892 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 321 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:54,892 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 569 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:54,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19835 states. [2025-04-13 19:00:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19835 to 10423. [2025-04-13 19:00:55,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10423 states, 10422 states have (on average 3.828247937056227) internal successors, (39898), 10422 states have internal predecessors, (39898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10423 states to 10423 states and 39898 transitions. [2025-04-13 19:00:55,152 INFO L79 Accepts]: Start accepts. Automaton has 10423 states and 39898 transitions. Word has length 54 [2025-04-13 19:00:55,153 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:55,153 INFO L485 AbstractCegarLoop]: Abstraction has 10423 states and 39898 transitions. [2025-04-13 19:00:55,153 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:55,153 INFO L278 IsEmpty]: Start isEmpty. Operand 10423 states and 39898 transitions. [2025-04-13 19:00:55,169 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:55,169 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:55,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:55,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable331 [2025-04-13 19:00:55,169 INFO L403 AbstractCegarLoop]: === Iteration 333 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:55,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:55,170 INFO L85 PathProgramCache]: Analyzing trace with hash -637419904, now seen corresponding path program 333 times [2025-04-13 19:00:55,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:55,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121483611] [2025-04-13 19:00:55,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:00:55,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:55,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:55,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:55,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:00:55,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:55,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:55,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121483611] [2025-04-13 19:00:55,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121483611] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:55,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:55,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:55,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270976141] [2025-04-13 19:00:55,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:55,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:55,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:55,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:55,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:55,748 INFO L87 Difference]: Start difference. First operand 10423 states and 39898 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:56,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:56,620 INFO L93 Difference]: Finished difference Result 18902 states and 69954 transitions. [2025-04-13 19:00:56,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:00:56,620 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:56,620 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:56,688 INFO L225 Difference]: With dead ends: 18902 [2025-04-13 19:00:56,688 INFO L226 Difference]: Without dead ends: 18838 [2025-04-13 19:00:56,694 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=438, Unknown=0, NotChecked=0, Total=650 [2025-04-13 19:00:56,695 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 298 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:56,695 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 545 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:56,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18838 states. [2025-04-13 19:00:56,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18838 to 10447. [2025-04-13 19:00:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10447 states, 10446 states have (on average 3.8267279341374687) internal successors, (39974), 10446 states have internal predecessors, (39974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10447 states to 10447 states and 39974 transitions. [2025-04-13 19:00:56,987 INFO L79 Accepts]: Start accepts. Automaton has 10447 states and 39974 transitions. Word has length 54 [2025-04-13 19:00:56,987 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:56,987 INFO L485 AbstractCegarLoop]: Abstraction has 10447 states and 39974 transitions. [2025-04-13 19:00:56,987 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:56,987 INFO L278 IsEmpty]: Start isEmpty. Operand 10447 states and 39974 transitions. [2025-04-13 19:00:57,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:57,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:57,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] [2025-04-13 19:00:57,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable332 [2025-04-13 19:00:57,003 INFO L403 AbstractCegarLoop]: === Iteration 334 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:57,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:57,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1488769108, now seen corresponding path program 334 times [2025-04-13 19:00:57,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:57,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762206764] [2025-04-13 19:00:57,004 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:00:57,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:57,007 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:00:57,018 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:57,018 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:00:57,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:57,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:57,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762206764] [2025-04-13 19:00:57,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762206764] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:57,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:57,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:57,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547650772] [2025-04-13 19:00:57,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:57,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:57,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:57,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:57,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:57,632 INFO L87 Difference]: Start difference. First operand 10447 states and 39974 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:58,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:58,593 INFO L93 Difference]: Finished difference Result 20041 states and 73710 transitions. [2025-04-13 19:00:58,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:00:58,593 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:00:58,593 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:58,663 INFO L225 Difference]: With dead ends: 20041 [2025-04-13 19:00:58,663 INFO L226 Difference]: Without dead ends: 19971 [2025-04-13 19:00:58,670 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=440, Unknown=0, NotChecked=0, Total=650 [2025-04-13 19:00:58,670 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 334 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:58,670 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 595 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:00:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19971 states. [2025-04-13 19:00:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19971 to 10480. [2025-04-13 19:00:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10480 states, 10479 states have (on average 3.824506155167478) internal successors, (40077), 10479 states have internal predecessors, (40077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10480 states to 10480 states and 40077 transitions. [2025-04-13 19:00:58,920 INFO L79 Accepts]: Start accepts. Automaton has 10480 states and 40077 transitions. Word has length 54 [2025-04-13 19:00:58,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:58,921 INFO L485 AbstractCegarLoop]: Abstraction has 10480 states and 40077 transitions. [2025-04-13 19:00:58,921 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:58,921 INFO L278 IsEmpty]: Start isEmpty. Operand 10480 states and 40077 transitions. [2025-04-13 19:00:58,973 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:00:58,973 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:58,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:00:58,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable333 [2025-04-13 19:00:58,973 INFO L403 AbstractCegarLoop]: === Iteration 335 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:00:58,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:58,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1407897886, now seen corresponding path program 335 times [2025-04-13 19:00:58,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:58,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820578218] [2025-04-13 19:00:58,974 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:00:58,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:58,977 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:00:58,987 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:00:58,987 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:00:58,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:59,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:59,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:59,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820578218] [2025-04-13 19:00:59,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820578218] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:59,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:59,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:00:59,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612786460] [2025-04-13 19:00:59,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:59,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:00:59,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:59,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:00:59,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:00:59,540 INFO L87 Difference]: Start difference. First operand 10480 states and 40077 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:00,360 INFO L93 Difference]: Finished difference Result 18939 states and 70061 transitions. [2025-04-13 19:01:00,360 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:01:00,360 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:00,360 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:00,421 INFO L225 Difference]: With dead ends: 18939 [2025-04-13 19:01:00,421 INFO L226 Difference]: Without dead ends: 18863 [2025-04-13 19:01:00,428 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:01:00,429 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 341 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:00,429 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 494 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 19:01:00,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18863 states. [2025-04-13 19:01:00,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18863 to 10472. [2025-04-13 19:01:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10472 states, 10471 states have (on average 3.824754082704613) internal successors, (40049), 10471 states have internal predecessors, (40049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:00,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10472 states to 10472 states and 40049 transitions. [2025-04-13 19:01:00,674 INFO L79 Accepts]: Start accepts. Automaton has 10472 states and 40049 transitions. Word has length 54 [2025-04-13 19:01:00,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:00,674 INFO L485 AbstractCegarLoop]: Abstraction has 10472 states and 40049 transitions. [2025-04-13 19:01:00,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:00,675 INFO L278 IsEmpty]: Start isEmpty. Operand 10472 states and 40049 transitions. [2025-04-13 19:01:00,690 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:00,691 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:00,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] [2025-04-13 19:01:00,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable334 [2025-04-13 19:01:00,691 INFO L403 AbstractCegarLoop]: === Iteration 336 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:00,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:00,691 INFO L85 PathProgramCache]: Analyzing trace with hash 718291126, now seen corresponding path program 336 times [2025-04-13 19:01:00,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:00,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759179519] [2025-04-13 19:01:00,691 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:01:00,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:00,694 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:00,703 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:00,703 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:01:00,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:01,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:01,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759179519] [2025-04-13 19:01:01,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759179519] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:01,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:01,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:01,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734216216] [2025-04-13 19:01:01,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:01,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:01,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:01,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:01,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:01,343 INFO L87 Difference]: Start difference. First operand 10472 states and 40049 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:02,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:02,264 INFO L93 Difference]: Finished difference Result 20034 states and 73673 transitions. [2025-04-13 19:01:02,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:01:02,264 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:02,264 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:02,346 INFO L225 Difference]: With dead ends: 20034 [2025-04-13 19:01:02,346 INFO L226 Difference]: Without dead ends: 19952 [2025-04-13 19:01:02,354 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:01:02,355 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 312 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:02,355 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 539 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:02,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19952 states. [2025-04-13 19:01:02,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19952 to 10461. [2025-04-13 19:01:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10461 states, 10460 states have (on average 3.8251434034416825) internal successors, (40011), 10460 states have internal predecessors, (40011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10461 states to 10461 states and 40011 transitions. [2025-04-13 19:01:02,622 INFO L79 Accepts]: Start accepts. Automaton has 10461 states and 40011 transitions. Word has length 54 [2025-04-13 19:01:02,623 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:02,623 INFO L485 AbstractCegarLoop]: Abstraction has 10461 states and 40011 transitions. [2025-04-13 19:01:02,623 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:02,623 INFO L278 IsEmpty]: Start isEmpty. Operand 10461 states and 40011 transitions. [2025-04-13 19:01:02,638 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:02,639 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:02,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:02,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable335 [2025-04-13 19:01:02,639 INFO L403 AbstractCegarLoop]: === Iteration 337 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:02,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:02,639 INFO L85 PathProgramCache]: Analyzing trace with hash 200417296, now seen corresponding path program 337 times [2025-04-13 19:01:02,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:02,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888781209] [2025-04-13 19:01:02,639 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:01:02,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:02,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:02,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:02,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:02,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:03,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:03,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888781209] [2025-04-13 19:01:03,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888781209] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:03,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:03,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:03,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390866730] [2025-04-13 19:01:03,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:03,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:03,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:03,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:03,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:03,257 INFO L87 Difference]: Start difference. First operand 10461 states and 40011 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:04,133 INFO L93 Difference]: Finished difference Result 18852 states and 69822 transitions. [2025-04-13 19:01:04,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:01:04,133 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:04,133 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:04,199 INFO L225 Difference]: With dead ends: 18852 [2025-04-13 19:01:04,199 INFO L226 Difference]: Without dead ends: 18616 [2025-04-13 19:01:04,205 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:01:04,205 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 262 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:04,205 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 552 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18616 states. [2025-04-13 19:01:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18616 to 10333. [2025-04-13 19:01:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10333 states, 10332 states have (on average 3.833042973286876) internal successors, (39603), 10332 states have internal predecessors, (39603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:04,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10333 states to 10333 states and 39603 transitions. [2025-04-13 19:01:04,446 INFO L79 Accepts]: Start accepts. Automaton has 10333 states and 39603 transitions. Word has length 54 [2025-04-13 19:01:04,446 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:04,446 INFO L485 AbstractCegarLoop]: Abstraction has 10333 states and 39603 transitions. [2025-04-13 19:01:04,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:04,446 INFO L278 IsEmpty]: Start isEmpty. Operand 10333 states and 39603 transitions. [2025-04-13 19:01:04,461 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:04,461 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:04,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:04,461 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable336 [2025-04-13 19:01:04,462 INFO L403 AbstractCegarLoop]: === Iteration 338 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:04,462 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:04,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1968360988, now seen corresponding path program 338 times [2025-04-13 19:01:04,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:04,462 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964717734] [2025-04-13 19:01:04,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:04,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:04,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:04,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:04,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:01:04,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:05,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:05,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964717734] [2025-04-13 19:01:05,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964717734] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:05,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:05,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:05,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610536151] [2025-04-13 19:01:05,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:05,049 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:05,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:05,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:05,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:05,049 INFO L87 Difference]: Start difference. First operand 10333 states and 39603 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:06,075 INFO L93 Difference]: Finished difference Result 19824 states and 73047 transitions. [2025-04-13 19:01:06,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:01:06,075 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:06,075 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:06,145 INFO L225 Difference]: With dead ends: 19824 [2025-04-13 19:01:06,145 INFO L226 Difference]: Without dead ends: 19515 [2025-04-13 19:01:06,149 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:01:06,149 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 296 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:06,149 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 629 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:01:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19515 states. [2025-04-13 19:01:06,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19515 to 10141. [2025-04-13 19:01:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10141 states, 10140 states have (on average 3.846646942800789) internal successors, (39005), 10140 states have internal predecessors, (39005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10141 states to 10141 states and 39005 transitions. [2025-04-13 19:01:06,381 INFO L79 Accepts]: Start accepts. Automaton has 10141 states and 39005 transitions. Word has length 54 [2025-04-13 19:01:06,381 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:06,381 INFO L485 AbstractCegarLoop]: Abstraction has 10141 states and 39005 transitions. [2025-04-13 19:01:06,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:06,381 INFO L278 IsEmpty]: Start isEmpty. Operand 10141 states and 39005 transitions. [2025-04-13 19:01:06,397 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:06,397 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:06,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:06,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable337 [2025-04-13 19:01:06,397 INFO L403 AbstractCegarLoop]: === Iteration 339 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:06,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:06,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1722906942, now seen corresponding path program 339 times [2025-04-13 19:01:06,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:06,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635577083] [2025-04-13 19:01:06,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:01:06,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:06,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:06,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:06,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:01:06,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:07,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:07,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635577083] [2025-04-13 19:01:07,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635577083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:07,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:07,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:07,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284781920] [2025-04-13 19:01:07,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:07,026 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:07,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:07,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:07,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:07,026 INFO L87 Difference]: Start difference. First operand 10141 states and 39005 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:08,019 INFO L93 Difference]: Finished difference Result 18786 states and 69616 transitions. [2025-04-13 19:01:08,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:08,019 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:08,019 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:08,087 INFO L225 Difference]: With dead ends: 18786 [2025-04-13 19:01:08,087 INFO L226 Difference]: Without dead ends: 18674 [2025-04-13 19:01:08,093 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:08,094 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 285 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:08,094 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 567 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1509 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:01:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18674 states. [2025-04-13 19:01:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18674 to 10209. [2025-04-13 19:01:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10209 states, 10208 states have (on average 3.84375) internal successors, (39237), 10208 states have internal predecessors, (39237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10209 states to 10209 states and 39237 transitions. [2025-04-13 19:01:08,398 INFO L79 Accepts]: Start accepts. Automaton has 10209 states and 39237 transitions. Word has length 54 [2025-04-13 19:01:08,398 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:08,398 INFO L485 AbstractCegarLoop]: Abstraction has 10209 states and 39237 transitions. [2025-04-13 19:01:08,398 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:08,398 INFO L278 IsEmpty]: Start isEmpty. Operand 10209 states and 39237 transitions. [2025-04-13 19:01:08,414 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:08,414 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:08,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] [2025-04-13 19:01:08,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable338 [2025-04-13 19:01:08,414 INFO L403 AbstractCegarLoop]: === Iteration 340 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:08,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:08,415 INFO L85 PathProgramCache]: Analyzing trace with hash 632060492, now seen corresponding path program 340 times [2025-04-13 19:01:08,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:08,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818121915] [2025-04-13 19:01:08,415 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:01:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:08,417 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:01:08,429 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:08,429 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:01:08,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:09,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:09,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818121915] [2025-04-13 19:01:09,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818121915] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:09,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:09,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:09,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432533376] [2025-04-13 19:01:09,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:09,000 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:09,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:09,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:09,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:09,000 INFO L87 Difference]: Start difference. First operand 10209 states and 39237 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:09,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:09,870 INFO L93 Difference]: Finished difference Result 19982 states and 73596 transitions. [2025-04-13 19:01:09,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:09,871 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:09,871 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:09,939 INFO L225 Difference]: With dead ends: 19982 [2025-04-13 19:01:09,939 INFO L226 Difference]: Without dead ends: 19846 [2025-04-13 19:01:09,945 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:09,945 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 336 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:09,945 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 580 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:09,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19846 states. [2025-04-13 19:01:10,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19846 to 10297. [2025-04-13 19:01:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10297 states, 10296 states have (on average 3.8396464646464645) internal successors, (39533), 10296 states have internal predecessors, (39533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10297 states to 10297 states and 39533 transitions. [2025-04-13 19:01:10,196 INFO L79 Accepts]: Start accepts. Automaton has 10297 states and 39533 transitions. Word has length 54 [2025-04-13 19:01:10,196 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:10,197 INFO L485 AbstractCegarLoop]: Abstraction has 10297 states and 39533 transitions. [2025-04-13 19:01:10,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:10,197 INFO L278 IsEmpty]: Start isEmpty. Operand 10297 states and 39533 transitions. [2025-04-13 19:01:10,212 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:10,212 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:10,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:10,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable339 [2025-04-13 19:01:10,212 INFO L403 AbstractCegarLoop]: === Iteration 341 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:10,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:10,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2080881220, now seen corresponding path program 341 times [2025-04-13 19:01:10,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:10,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272140161] [2025-04-13 19:01:10,213 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:01:10,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:10,215 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:10,226 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:10,226 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:01:10,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:10,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:10,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272140161] [2025-04-13 19:01:10,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272140161] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:10,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:10,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:10,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197633179] [2025-04-13 19:01:10,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:10,838 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:10,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:10,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:10,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:10,839 INFO L87 Difference]: Start difference. First operand 10297 states and 39533 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:11,688 INFO L93 Difference]: Finished difference Result 18902 states and 69945 transitions. [2025-04-13 19:01:11,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:11,688 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:11,688 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:11,750 INFO L225 Difference]: With dead ends: 18902 [2025-04-13 19:01:11,750 INFO L226 Difference]: Without dead ends: 18838 [2025-04-13 19:01:11,756 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:11,757 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 343 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:11,757 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 588 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18838 states. [2025-04-13 19:01:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18838 to 10305. [2025-04-13 19:01:11,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10305 states, 10304 states have (on average 3.8386063664596275) internal successors, (39553), 10304 states have internal predecessors, (39553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10305 states to 10305 states and 39553 transitions. [2025-04-13 19:01:11,976 INFO L79 Accepts]: Start accepts. Automaton has 10305 states and 39553 transitions. Word has length 54 [2025-04-13 19:01:11,977 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:11,977 INFO L485 AbstractCegarLoop]: Abstraction has 10305 states and 39553 transitions. [2025-04-13 19:01:11,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:11,977 INFO L278 IsEmpty]: Start isEmpty. Operand 10305 states and 39553 transitions. [2025-04-13 19:01:11,992 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:11,992 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:11,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:11,992 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable340 [2025-04-13 19:01:11,993 INFO L403 AbstractCegarLoop]: === Iteration 342 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:11,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:11,993 INFO L85 PathProgramCache]: Analyzing trace with hash 627140888, now seen corresponding path program 342 times [2025-04-13 19:01:11,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:11,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031242514] [2025-04-13 19:01:11,993 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:01:11,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:11,995 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:12,005 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:12,005 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:01:12,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:12,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:12,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031242514] [2025-04-13 19:01:12,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031242514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:12,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:12,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:12,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915972161] [2025-04-13 19:01:12,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:12,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:12,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:12,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:12,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:12,660 INFO L87 Difference]: Start difference. First operand 10305 states and 39553 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:13,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:13,693 INFO L93 Difference]: Finished difference Result 20006 states and 73606 transitions. [2025-04-13 19:01:13,693 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:13,693 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:13,694 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:13,760 INFO L225 Difference]: With dead ends: 20006 [2025-04-13 19:01:13,760 INFO L226 Difference]: Without dead ends: 19936 [2025-04-13 19:01:13,766 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:13,767 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 302 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:13,767 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 614 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:01:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19936 states. [2025-04-13 19:01:13,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19936 to 10316. [2025-04-13 19:01:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10316 states, 10315 states have (on average 3.837130392632089) internal successors, (39580), 10315 states have internal predecessors, (39580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10316 states to 10316 states and 39580 transitions. [2025-04-13 19:01:14,022 INFO L79 Accepts]: Start accepts. Automaton has 10316 states and 39580 transitions. Word has length 54 [2025-04-13 19:01:14,023 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:14,023 INFO L485 AbstractCegarLoop]: Abstraction has 10316 states and 39580 transitions. [2025-04-13 19:01:14,023 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:14,023 INFO L278 IsEmpty]: Start isEmpty. Operand 10316 states and 39580 transitions. [2025-04-13 19:01:14,039 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:14,039 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:14,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:14,039 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable341 [2025-04-13 19:01:14,039 INFO L403 AbstractCegarLoop]: === Iteration 343 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:14,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:14,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1443608094, now seen corresponding path program 343 times [2025-04-13 19:01:14,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:14,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064364889] [2025-04-13 19:01:14,040 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:01:14,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:14,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:14,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:14,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:14,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:14,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:14,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064364889] [2025-04-13 19:01:14,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064364889] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:14,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:14,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:14,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529855477] [2025-04-13 19:01:14,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:14,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:14,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:14,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:14,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:14,680 INFO L87 Difference]: Start difference. First operand 10316 states and 39580 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:15,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:15,552 INFO L93 Difference]: Finished difference Result 18849 states and 69803 transitions. [2025-04-13 19:01:15,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:01:15,552 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:15,552 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:15,621 INFO L225 Difference]: With dead ends: 18849 [2025-04-13 19:01:15,621 INFO L226 Difference]: Without dead ends: 18749 [2025-04-13 19:01:15,627 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:15,628 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 317 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:15,628 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 554 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18749 states. [2025-04-13 19:01:15,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18749 to 10284. [2025-04-13 19:01:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10284 states, 10283 states have (on average 3.840124477292619) internal successors, (39488), 10283 states have internal predecessors, (39488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:15,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10284 states to 10284 states and 39488 transitions. [2025-04-13 19:01:15,876 INFO L79 Accepts]: Start accepts. Automaton has 10284 states and 39488 transitions. Word has length 54 [2025-04-13 19:01:15,876 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:15,876 INFO L485 AbstractCegarLoop]: Abstraction has 10284 states and 39488 transitions. [2025-04-13 19:01:15,876 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:15,876 INFO L278 IsEmpty]: Start isEmpty. Operand 10284 states and 39488 transitions. [2025-04-13 19:01:15,892 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:15,892 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:15,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:15,892 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable342 [2025-04-13 19:01:15,892 INFO L403 AbstractCegarLoop]: === Iteration 344 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:15,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:15,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2096728570, now seen corresponding path program 344 times [2025-04-13 19:01:15,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:15,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447639435] [2025-04-13 19:01:15,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:15,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:15,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:15,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:15,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:01:15,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:16,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:16,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:16,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447639435] [2025-04-13 19:01:16,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447639435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:16,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:16,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:16,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660346659] [2025-04-13 19:01:16,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:16,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:16,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:16,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:16,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:16,513 INFO L87 Difference]: Start difference. First operand 10284 states and 39488 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:17,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:17,557 INFO L93 Difference]: Finished difference Result 19904 states and 73325 transitions. [2025-04-13 19:01:17,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:17,557 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:17,557 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:17,631 INFO L225 Difference]: With dead ends: 19904 [2025-04-13 19:01:17,632 INFO L226 Difference]: Without dead ends: 19789 [2025-04-13 19:01:17,639 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:17,639 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 340 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:17,639 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 591 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:17,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19789 states. [2025-04-13 19:01:17,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19789 to 10240. [2025-04-13 19:01:17,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10240 states, 10239 states have (on average 3.844613731809747) internal successors, (39365), 10239 states have internal predecessors, (39365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10240 states to 10240 states and 39365 transitions. [2025-04-13 19:01:17,893 INFO L79 Accepts]: Start accepts. Automaton has 10240 states and 39365 transitions. Word has length 54 [2025-04-13 19:01:17,893 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:17,893 INFO L485 AbstractCegarLoop]: Abstraction has 10240 states and 39365 transitions. [2025-04-13 19:01:17,893 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:17,893 INFO L278 IsEmpty]: Start isEmpty. Operand 10240 states and 39365 transitions. [2025-04-13 19:01:17,909 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:17,910 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:17,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:17,910 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable343 [2025-04-13 19:01:17,910 INFO L403 AbstractCegarLoop]: === Iteration 345 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:17,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:17,910 INFO L85 PathProgramCache]: Analyzing trace with hash -107256034, now seen corresponding path program 345 times [2025-04-13 19:01:17,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:17,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558257294] [2025-04-13 19:01:17,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:01:17,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:17,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:17,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:17,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:01:17,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:18,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:18,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558257294] [2025-04-13 19:01:18,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558257294] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:18,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:18,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:18,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502523328] [2025-04-13 19:01:18,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:18,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:18,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:18,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:18,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:18,491 INFO L87 Difference]: Start difference. First operand 10240 states and 39365 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:19,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:19,421 INFO L93 Difference]: Finished difference Result 18677 states and 69327 transitions. [2025-04-13 19:01:19,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:19,421 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:19,421 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:19,486 INFO L225 Difference]: With dead ends: 18677 [2025-04-13 19:01:19,486 INFO L226 Difference]: Without dead ends: 18565 [2025-04-13 19:01:19,492 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:19,492 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 278 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:19,492 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 527 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:19,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18565 states. [2025-04-13 19:01:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18565 to 10264. [2025-04-13 19:01:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10264 states, 10263 states have (on average 3.841469355938809) internal successors, (39425), 10263 states have internal predecessors, (39425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10264 states to 10264 states and 39425 transitions. [2025-04-13 19:01:19,787 INFO L79 Accepts]: Start accepts. Automaton has 10264 states and 39425 transitions. Word has length 54 [2025-04-13 19:01:19,788 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:19,788 INFO L485 AbstractCegarLoop]: Abstraction has 10264 states and 39425 transitions. [2025-04-13 19:01:19,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:19,788 INFO L278 IsEmpty]: Start isEmpty. Operand 10264 states and 39425 transitions. [2025-04-13 19:01:19,803 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:19,803 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:19,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:19,803 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable344 [2025-04-13 19:01:19,803 INFO L403 AbstractCegarLoop]: === Iteration 346 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:19,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:19,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1383834668, now seen corresponding path program 346 times [2025-04-13 19:01:19,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:19,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853948299] [2025-04-13 19:01:19,804 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:01:19,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:19,807 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:01:19,819 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:19,819 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:01:19,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:20,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 19:01:20,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:20,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853948299] [2025-04-13 19:01:20,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853948299] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:20,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:20,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:20,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634802835] [2025-04-13 19:01:20,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:20,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:20,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:20,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:20,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:20,526 INFO L87 Difference]: Start difference. First operand 10264 states and 39425 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:21,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:21,471 INFO L93 Difference]: Finished difference Result 19779 states and 72977 transitions. [2025-04-13 19:01:21,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:21,471 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:21,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:21,536 INFO L225 Difference]: With dead ends: 19779 [2025-04-13 19:01:21,536 INFO L226 Difference]: Without dead ends: 19643 [2025-04-13 19:01:21,543 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:21,543 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 275 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:21,543 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 658 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:01:21,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19643 states. [2025-04-13 19:01:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19643 to 10294. [2025-04-13 19:01:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10294 states, 10293 states have (on average 3.8375595064607015) internal successors, (39500), 10293 states have internal predecessors, (39500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10294 states to 10294 states and 39500 transitions. [2025-04-13 19:01:21,787 INFO L79 Accepts]: Start accepts. Automaton has 10294 states and 39500 transitions. Word has length 54 [2025-04-13 19:01:21,788 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:21,788 INFO L485 AbstractCegarLoop]: Abstraction has 10294 states and 39500 transitions. [2025-04-13 19:01:21,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:21,788 INFO L278 IsEmpty]: Start isEmpty. Operand 10294 states and 39500 transitions. [2025-04-13 19:01:21,803 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:21,804 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:21,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:21,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable345 [2025-04-13 19:01:21,804 INFO L403 AbstractCegarLoop]: === Iteration 347 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:21,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash -486062660, now seen corresponding path program 347 times [2025-04-13 19:01:21,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:21,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365040424] [2025-04-13 19:01:21,804 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:01:21,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:21,807 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:21,818 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:21,818 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:01:21,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:22,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:22,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365040424] [2025-04-13 19:01:22,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365040424] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:22,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:22,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:22,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39979481] [2025-04-13 19:01:22,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:22,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:22,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:22,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:22,423 INFO L87 Difference]: Start difference. First operand 10294 states and 39500 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:23,248 INFO L93 Difference]: Finished difference Result 18738 states and 69442 transitions. [2025-04-13 19:01:23,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:23,248 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:23,248 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:23,316 INFO L225 Difference]: With dead ends: 18738 [2025-04-13 19:01:23,316 INFO L226 Difference]: Without dead ends: 18674 [2025-04-13 19:01:23,322 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:23,323 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 321 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:23,323 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 572 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:23,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18674 states. [2025-04-13 19:01:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18674 to 10302. [2025-04-13 19:01:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10302 states, 10301 states have (on average 3.836520726143093) internal successors, (39520), 10301 states have internal predecessors, (39520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10302 states to 10302 states and 39520 transitions. [2025-04-13 19:01:23,562 INFO L79 Accepts]: Start accepts. Automaton has 10302 states and 39520 transitions. Word has length 54 [2025-04-13 19:01:23,562 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:23,562 INFO L485 AbstractCegarLoop]: Abstraction has 10302 states and 39520 transitions. [2025-04-13 19:01:23,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:23,562 INFO L278 IsEmpty]: Start isEmpty. Operand 10302 states and 39520 transitions. [2025-04-13 19:01:23,577 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:23,577 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:23,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:23,577 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable346 [2025-04-13 19:01:23,577 INFO L403 AbstractCegarLoop]: === Iteration 348 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:23,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1720724004, now seen corresponding path program 348 times [2025-04-13 19:01:23,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:23,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831184404] [2025-04-13 19:01:23,578 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:01:23,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:23,580 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:23,590 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:23,590 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:01:23,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:24,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:24,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831184404] [2025-04-13 19:01:24,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831184404] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:24,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:24,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:24,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103614650] [2025-04-13 19:01:24,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:24,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:24,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:24,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:24,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:24,230 INFO L87 Difference]: Start difference. First operand 10302 states and 39520 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:25,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:25,120 INFO L93 Difference]: Finished difference Result 19799 states and 72980 transitions. [2025-04-13 19:01:25,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:25,120 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:25,120 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:25,185 INFO L225 Difference]: With dead ends: 19799 [2025-04-13 19:01:25,185 INFO L226 Difference]: Without dead ends: 19729 [2025-04-13 19:01:25,192 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:25,192 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 320 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:25,192 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 520 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19729 states. [2025-04-13 19:01:25,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19729 to 10312. [2025-04-13 19:01:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10312 states, 10311 states have (on average 3.8352245175055764) internal successors, (39545), 10311 states have internal predecessors, (39545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10312 states to 10312 states and 39545 transitions. [2025-04-13 19:01:25,440 INFO L79 Accepts]: Start accepts. Automaton has 10312 states and 39545 transitions. Word has length 54 [2025-04-13 19:01:25,440 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:25,440 INFO L485 AbstractCegarLoop]: Abstraction has 10312 states and 39545 transitions. [2025-04-13 19:01:25,441 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:25,441 INFO L278 IsEmpty]: Start isEmpty. Operand 10312 states and 39545 transitions. [2025-04-13 19:01:25,456 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:25,456 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:25,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:25,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable347 [2025-04-13 19:01:25,456 INFO L403 AbstractCegarLoop]: === Iteration 349 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:25,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:25,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1086883298, now seen corresponding path program 349 times [2025-04-13 19:01:25,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:25,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457491907] [2025-04-13 19:01:25,457 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:01:25,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:25,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:25,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:25,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:25,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:26,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:26,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457491907] [2025-04-13 19:01:26,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457491907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:26,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:26,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:26,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207659247] [2025-04-13 19:01:26,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:26,072 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:26,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:26,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:26,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:26,072 INFO L87 Difference]: Start difference. First operand 10312 states and 39545 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:26,875 INFO L93 Difference]: Finished difference Result 18684 states and 69298 transitions. [2025-04-13 19:01:26,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:26,876 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:26,876 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:26,940 INFO L225 Difference]: With dead ends: 18684 [2025-04-13 19:01:26,940 INFO L226 Difference]: Without dead ends: 18581 [2025-04-13 19:01:26,946 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:26,946 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 294 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:26,946 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 559 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 19:01:26,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18581 states. [2025-04-13 19:01:27,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18581 to 10280. [2025-04-13 19:01:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10280 states, 10279 states have (on average 3.838213834030548) internal successors, (39453), 10279 states have internal predecessors, (39453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:27,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10280 states to 10280 states and 39453 transitions. [2025-04-13 19:01:27,186 INFO L79 Accepts]: Start accepts. Automaton has 10280 states and 39453 transitions. Word has length 54 [2025-04-13 19:01:27,186 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:27,186 INFO L485 AbstractCegarLoop]: Abstraction has 10280 states and 39453 transitions. [2025-04-13 19:01:27,186 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:27,186 INFO L278 IsEmpty]: Start isEmpty. Operand 10280 states and 39453 transitions. [2025-04-13 19:01:27,202 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:27,202 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:27,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] [2025-04-13 19:01:27,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable348 [2025-04-13 19:01:27,202 INFO L403 AbstractCegarLoop]: === Iteration 350 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:27,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:27,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2017509376, now seen corresponding path program 350 times [2025-04-13 19:01:27,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:27,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984908753] [2025-04-13 19:01:27,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:27,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:27,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:27,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:27,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:01:27,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:27,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:27,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:27,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984908753] [2025-04-13 19:01:27,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984908753] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:27,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:27,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:27,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042321742] [2025-04-13 19:01:27,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:27,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:27,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:27,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:27,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:27,831 INFO L87 Difference]: Start difference. First operand 10280 states and 39453 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:28,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:28,737 INFO L93 Difference]: Finished difference Result 19697 states and 72700 transitions. [2025-04-13 19:01:28,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:28,737 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:28,737 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:28,803 INFO L225 Difference]: With dead ends: 19697 [2025-04-13 19:01:28,803 INFO L226 Difference]: Without dead ends: 19589 [2025-04-13 19:01:28,809 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:28,809 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 306 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:28,809 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 473 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 19:01:28,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19589 states. [2025-04-13 19:01:28,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19589 to 10240. [2025-04-13 19:01:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10240 states, 10239 states have (on average 3.8419767555425333) internal successors, (39338), 10239 states have internal predecessors, (39338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10240 states to 10240 states and 39338 transitions. [2025-04-13 19:01:29,044 INFO L79 Accepts]: Start accepts. Automaton has 10240 states and 39338 transitions. Word has length 54 [2025-04-13 19:01:29,045 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:29,045 INFO L485 AbstractCegarLoop]: Abstraction has 10240 states and 39338 transitions. [2025-04-13 19:01:29,045 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:29,045 INFO L278 IsEmpty]: Start isEmpty. Operand 10240 states and 39338 transitions. [2025-04-13 19:01:29,060 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:29,060 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:29,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:29,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable349 [2025-04-13 19:01:29,061 INFO L403 AbstractCegarLoop]: === Iteration 351 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:29,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:29,061 INFO L85 PathProgramCache]: Analyzing trace with hash 284774846, now seen corresponding path program 351 times [2025-04-13 19:01:29,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:29,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557052511] [2025-04-13 19:01:29,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:01:29,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:29,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:29,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:29,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:01:29,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:29,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 19:01:29,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:29,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557052511] [2025-04-13 19:01:29,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557052511] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:29,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:29,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:29,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592319108] [2025-04-13 19:01:29,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:29,648 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:29,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:29,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:29,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:29,648 INFO L87 Difference]: Start difference. First operand 10240 states and 39338 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:30,690 INFO L93 Difference]: Finished difference Result 18818 states and 69668 transitions. [2025-04-13 19:01:30,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:30,690 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:30,690 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:30,756 INFO L225 Difference]: With dead ends: 18818 [2025-04-13 19:01:30,756 INFO L226 Difference]: Without dead ends: 18754 [2025-04-13 19:01:30,762 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:30,763 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 296 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:30,763 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 644 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:01:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18754 states. [2025-04-13 19:01:31,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18754 to 10252. [2025-04-13 19:01:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10252 states, 10251 states have (on average 3.840991122817286) internal successors, (39374), 10251 states have internal predecessors, (39374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10252 states to 10252 states and 39374 transitions. [2025-04-13 19:01:31,073 INFO L79 Accepts]: Start accepts. Automaton has 10252 states and 39374 transitions. Word has length 54 [2025-04-13 19:01:31,073 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:31,073 INFO L485 AbstractCegarLoop]: Abstraction has 10252 states and 39374 transitions. [2025-04-13 19:01:31,073 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:31,073 INFO L278 IsEmpty]: Start isEmpty. Operand 10252 states and 39374 transitions. [2025-04-13 19:01:31,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:31,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:31,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:31,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350 [2025-04-13 19:01:31,089 INFO L403 AbstractCegarLoop]: === Iteration 352 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:31,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:31,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1368235986, now seen corresponding path program 352 times [2025-04-13 19:01:31,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:31,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430873763] [2025-04-13 19:01:31,090 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:01:31,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:31,092 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:01:31,102 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:31,102 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:01:31,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:31,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:31,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430873763] [2025-04-13 19:01:31,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430873763] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:31,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:31,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:31,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558788126] [2025-04-13 19:01:31,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:31,627 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:31,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:31,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:31,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:31,627 INFO L87 Difference]: Start difference. First operand 10252 states and 39374 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:32,564 INFO L93 Difference]: Finished difference Result 19902 states and 73277 transitions. [2025-04-13 19:01:32,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:01:32,565 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:32,565 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:32,633 INFO L225 Difference]: With dead ends: 19902 [2025-04-13 19:01:32,633 INFO L226 Difference]: Without dead ends: 19832 [2025-04-13 19:01:32,640 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:32,640 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 320 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:32,640 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 601 Invalid, 1575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:32,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19832 states. [2025-04-13 19:01:32,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19832 to 10268. [2025-04-13 19:01:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10268 states, 10267 states have (on average 3.8395831304178434) internal successors, (39421), 10267 states have internal predecessors, (39421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10268 states to 10268 states and 39421 transitions. [2025-04-13 19:01:32,887 INFO L79 Accepts]: Start accepts. Automaton has 10268 states and 39421 transitions. Word has length 54 [2025-04-13 19:01:32,887 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:32,887 INFO L485 AbstractCegarLoop]: Abstraction has 10268 states and 39421 transitions. [2025-04-13 19:01:32,887 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:32,887 INFO L278 IsEmpty]: Start isEmpty. Operand 10268 states and 39421 transitions. [2025-04-13 19:01:32,903 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:32,903 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:32,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:32,903 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351 [2025-04-13 19:01:32,903 INFO L403 AbstractCegarLoop]: === Iteration 353 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:32,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:32,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1130489374, now seen corresponding path program 353 times [2025-04-13 19:01:32,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:32,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908549182] [2025-04-13 19:01:32,904 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:01:32,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:32,906 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:32,917 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:32,917 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:01:32,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:33,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:33,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908549182] [2025-04-13 19:01:33,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908549182] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:33,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:33,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:33,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985730348] [2025-04-13 19:01:33,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:33,573 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:33,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:33,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:33,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:33,573 INFO L87 Difference]: Start difference. First operand 10268 states and 39421 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:34,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:34,572 INFO L93 Difference]: Finished difference Result 18838 states and 69719 transitions. [2025-04-13 19:01:34,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:01:34,572 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:34,572 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:34,637 INFO L225 Difference]: With dead ends: 18838 [2025-04-13 19:01:34,637 INFO L226 Difference]: Without dead ends: 18762 [2025-04-13 19:01:34,643 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:34,643 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 352 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:34,643 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 566 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:34,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18762 states. [2025-04-13 19:01:34,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18762 to 10260. [2025-04-13 19:01:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10260 states, 10259 states have (on average 3.840237839945414) internal successors, (39397), 10259 states have internal predecessors, (39397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10260 states to 10260 states and 39397 transitions. [2025-04-13 19:01:34,884 INFO L79 Accepts]: Start accepts. Automaton has 10260 states and 39397 transitions. Word has length 54 [2025-04-13 19:01:34,884 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:34,884 INFO L485 AbstractCegarLoop]: Abstraction has 10260 states and 39397 transitions. [2025-04-13 19:01:34,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:34,885 INFO L278 IsEmpty]: Start isEmpty. Operand 10260 states and 39397 transitions. [2025-04-13 19:01:34,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:34,901 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:34,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:34,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable352 [2025-04-13 19:01:34,901 INFO L403 AbstractCegarLoop]: === Iteration 354 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:34,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:34,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1660812580, now seen corresponding path program 354 times [2025-04-13 19:01:34,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:34,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757621256] [2025-04-13 19:01:34,901 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:01:34,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:34,904 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:34,913 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:34,913 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:01:34,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:35,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:35,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757621256] [2025-04-13 19:01:35,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757621256] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:35,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:35,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:35,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937921004] [2025-04-13 19:01:35,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:35,562 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:35,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:35,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:35,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:35,563 INFO L87 Difference]: Start difference. First operand 10260 states and 39397 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:36,488 INFO L93 Difference]: Finished difference Result 19895 states and 73244 transitions. [2025-04-13 19:01:36,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:36,488 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:36,488 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:36,552 INFO L225 Difference]: With dead ends: 19895 [2025-04-13 19:01:36,553 INFO L226 Difference]: Without dead ends: 19813 [2025-04-13 19:01:36,559 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:36,559 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 343 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:36,559 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 526 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:36,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19813 states. [2025-04-13 19:01:36,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19813 to 10249. [2025-04-13 19:01:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10249 states, 10248 states have (on average 3.8412373145979704) internal successors, (39365), 10248 states have internal predecessors, (39365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 39365 transitions. [2025-04-13 19:01:36,813 INFO L79 Accepts]: Start accepts. Automaton has 10249 states and 39365 transitions. Word has length 54 [2025-04-13 19:01:36,813 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:36,813 INFO L485 AbstractCegarLoop]: Abstraction has 10249 states and 39365 transitions. [2025-04-13 19:01:36,814 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:36,814 INFO L278 IsEmpty]: Start isEmpty. Operand 10249 states and 39365 transitions. [2025-04-13 19:01:36,829 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:36,829 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:36,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:36,829 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable353 [2025-04-13 19:01:36,829 INFO L403 AbstractCegarLoop]: === Iteration 355 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:36,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:36,830 INFO L85 PathProgramCache]: Analyzing trace with hash 121976734, now seen corresponding path program 355 times [2025-04-13 19:01:36,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:36,830 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404569327] [2025-04-13 19:01:36,830 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:01:36,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:36,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:36,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:36,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:36,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:37,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:37,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:37,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404569327] [2025-04-13 19:01:37,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404569327] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:37,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:37,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:37,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900546066] [2025-04-13 19:01:37,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:37,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:37,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:37,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:37,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:37,388 INFO L87 Difference]: Start difference. First operand 10249 states and 39365 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:38,407 INFO L93 Difference]: Finished difference Result 18795 states and 69591 transitions. [2025-04-13 19:01:38,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:38,407 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:38,407 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:38,470 INFO L225 Difference]: With dead ends: 18795 [2025-04-13 19:01:38,470 INFO L226 Difference]: Without dead ends: 18731 [2025-04-13 19:01:38,477 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:38,477 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 323 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:38,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 561 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:38,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18731 states. [2025-04-13 19:01:38,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18731 to 10257. [2025-04-13 19:01:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10257 states, 10256 states have (on average 3.840191107644306) internal successors, (39385), 10256 states have internal predecessors, (39385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10257 states to 10257 states and 39385 transitions. [2025-04-13 19:01:38,723 INFO L79 Accepts]: Start accepts. Automaton has 10257 states and 39385 transitions. Word has length 54 [2025-04-13 19:01:38,723 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:38,723 INFO L485 AbstractCegarLoop]: Abstraction has 10257 states and 39385 transitions. [2025-04-13 19:01:38,723 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:38,723 INFO L278 IsEmpty]: Start isEmpty. Operand 10257 states and 39385 transitions. [2025-04-13 19:01:38,739 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:38,739 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:38,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:38,739 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable354 [2025-04-13 19:01:38,739 INFO L403 AbstractCegarLoop]: === Iteration 356 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:38,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:38,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1362984434, now seen corresponding path program 356 times [2025-04-13 19:01:38,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:38,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834107124] [2025-04-13 19:01:38,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:38,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:38,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:38,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:38,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:01:38,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:39,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:39,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834107124] [2025-04-13 19:01:39,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834107124] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:39,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:39,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:39,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544996178] [2025-04-13 19:01:39,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:39,346 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:39,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:39,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:39,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:39,346 INFO L87 Difference]: Start difference. First operand 10257 states and 39385 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:40,438 INFO L93 Difference]: Finished difference Result 19868 states and 73163 transitions. [2025-04-13 19:01:40,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:40,439 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:40,439 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:40,506 INFO L225 Difference]: With dead ends: 19868 [2025-04-13 19:01:40,506 INFO L226 Difference]: Without dead ends: 19798 [2025-04-13 19:01:40,510 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:40,510 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 298 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 1707 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:40,510 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 671 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1707 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 19:01:40,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19798 states. [2025-04-13 19:01:40,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19798 to 10267. [2025-04-13 19:01:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10267 states, 10266 states have (on average 3.8388856419248003) internal successors, (39410), 10266 states have internal predecessors, (39410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10267 states to 10267 states and 39410 transitions. [2025-04-13 19:01:40,740 INFO L79 Accepts]: Start accepts. Automaton has 10267 states and 39410 transitions. Word has length 54 [2025-04-13 19:01:40,740 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:40,740 INFO L485 AbstractCegarLoop]: Abstraction has 10267 states and 39410 transitions. [2025-04-13 19:01:40,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:40,740 INFO L278 IsEmpty]: Start isEmpty. Operand 10267 states and 39410 transitions. [2025-04-13 19:01:40,755 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:40,756 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:40,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:40,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable355 [2025-04-13 19:01:40,756 INFO L403 AbstractCegarLoop]: === Iteration 357 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:40,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:40,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2096507422, now seen corresponding path program 357 times [2025-04-13 19:01:40,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:40,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578181583] [2025-04-13 19:01:40,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:01:40,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:40,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:40,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:40,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:01:40,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:41,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 19:01:41,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:41,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578181583] [2025-04-13 19:01:41,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578181583] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:41,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:41,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:41,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486053666] [2025-04-13 19:01:41,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:41,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:41,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:41,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:41,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:41,351 INFO L87 Difference]: Start difference. First operand 10267 states and 39410 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:42,359 INFO L93 Difference]: Finished difference Result 18812 states and 69627 transitions. [2025-04-13 19:01:42,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:42,359 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:42,359 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:42,425 INFO L225 Difference]: With dead ends: 18812 [2025-04-13 19:01:42,425 INFO L226 Difference]: Without dead ends: 18733 [2025-04-13 19:01:42,431 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:42,431 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 311 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:42,431 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 623 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:01:42,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18733 states. [2025-04-13 19:01:42,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18733 to 10259. [2025-04-13 19:01:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10259 states, 10258 states have (on average 3.8395398713199453) internal successors, (39386), 10258 states have internal predecessors, (39386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10259 states to 10259 states and 39386 transitions. [2025-04-13 19:01:42,751 INFO L79 Accepts]: Start accepts. Automaton has 10259 states and 39386 transitions. Word has length 54 [2025-04-13 19:01:42,751 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:42,751 INFO L485 AbstractCegarLoop]: Abstraction has 10259 states and 39386 transitions. [2025-04-13 19:01:42,751 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:42,751 INFO L278 IsEmpty]: Start isEmpty. Operand 10259 states and 39386 transitions. [2025-04-13 19:01:42,767 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:42,767 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:42,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:42,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable356 [2025-04-13 19:01:42,768 INFO L403 AbstractCegarLoop]: === Iteration 358 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:42,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:42,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1343483904, now seen corresponding path program 358 times [2025-04-13 19:01:42,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:42,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787624650] [2025-04-13 19:01:42,768 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:01:42,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:42,771 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:01:42,782 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:42,782 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:01:42,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:43,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 19:01:43,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:43,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787624650] [2025-04-13 19:01:43,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787624650] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:43,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:43,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:43,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166018493] [2025-04-13 19:01:43,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:43,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:43,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:43,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:43,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:43,421 INFO L87 Difference]: Start difference. First operand 10259 states and 39386 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:44,329 INFO L93 Difference]: Finished difference Result 19858 states and 73124 transitions. [2025-04-13 19:01:44,329 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:44,329 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:44,329 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:44,401 INFO L225 Difference]: With dead ends: 19858 [2025-04-13 19:01:44,401 INFO L226 Difference]: Without dead ends: 19780 [2025-04-13 19:01:44,407 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:44,408 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 329 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:44,408 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 593 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19780 states. [2025-04-13 19:01:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19780 to 10249. [2025-04-13 19:01:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10249 states, 10248 states have (on average 3.840359094457455) internal successors, (39356), 10248 states have internal predecessors, (39356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 39356 transitions. [2025-04-13 19:01:44,639 INFO L79 Accepts]: Start accepts. Automaton has 10249 states and 39356 transitions. Word has length 54 [2025-04-13 19:01:44,640 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:44,640 INFO L485 AbstractCegarLoop]: Abstraction has 10249 states and 39356 transitions. [2025-04-13 19:01:44,640 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:44,640 INFO L278 IsEmpty]: Start isEmpty. Operand 10249 states and 39356 transitions. [2025-04-13 19:01:44,655 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:44,656 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:44,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:44,656 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable357 [2025-04-13 19:01:44,656 INFO L403 AbstractCegarLoop]: === Iteration 359 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:44,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:44,656 INFO L85 PathProgramCache]: Analyzing trace with hash -507566658, now seen corresponding path program 359 times [2025-04-13 19:01:44,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:44,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265526276] [2025-04-13 19:01:44,656 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:01:44,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:44,659 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:44,671 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:44,671 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:01:44,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:45,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:45,327 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265526276] [2025-04-13 19:01:45,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265526276] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:45,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:45,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:45,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572572813] [2025-04-13 19:01:45,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:45,328 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:45,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:45,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:45,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:45,328 INFO L87 Difference]: Start difference. First operand 10249 states and 39356 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:46,315 INFO L93 Difference]: Finished difference Result 18727 states and 69405 transitions. [2025-04-13 19:01:46,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:01:46,315 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:46,315 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:46,379 INFO L225 Difference]: With dead ends: 18727 [2025-04-13 19:01:46,379 INFO L226 Difference]: Without dead ends: 18659 [2025-04-13 19:01:46,385 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:46,385 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 341 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:46,385 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 552 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:46,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18659 states. [2025-04-13 19:01:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18659 to 10259. [2025-04-13 19:01:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10259 states, 10258 states have (on average 3.839052446870735) internal successors, (39381), 10258 states have internal predecessors, (39381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:46,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10259 states to 10259 states and 39381 transitions. [2025-04-13 19:01:46,621 INFO L79 Accepts]: Start accepts. Automaton has 10259 states and 39381 transitions. Word has length 54 [2025-04-13 19:01:46,621 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:46,621 INFO L485 AbstractCegarLoop]: Abstraction has 10259 states and 39381 transitions. [2025-04-13 19:01:46,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:46,621 INFO L278 IsEmpty]: Start isEmpty. Operand 10259 states and 39381 transitions. [2025-04-13 19:01:46,637 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:46,637 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:46,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:46,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable358 [2025-04-13 19:01:46,637 INFO L403 AbstractCegarLoop]: === Iteration 360 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:46,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:46,637 INFO L85 PathProgramCache]: Analyzing trace with hash -724181172, now seen corresponding path program 360 times [2025-04-13 19:01:46,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:46,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116571025] [2025-04-13 19:01:46,637 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:01:46,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:46,640 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:46,648 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:46,649 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:01:46,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:47,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:47,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116571025] [2025-04-13 19:01:47,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116571025] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:47,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:47,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:47,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65793331] [2025-04-13 19:01:47,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:47,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:47,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:47,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:47,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:47,325 INFO L87 Difference]: Start difference. First operand 10259 states and 39381 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:48,330 INFO L93 Difference]: Finished difference Result 19791 states and 72948 transitions. [2025-04-13 19:01:48,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:48,330 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:48,330 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:48,401 INFO L225 Difference]: With dead ends: 19791 [2025-04-13 19:01:48,401 INFO L226 Difference]: Without dead ends: 19720 [2025-04-13 19:01:48,408 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:48,408 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 332 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:48,408 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 599 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19720 states. [2025-04-13 19:01:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19720 to 10269. [2025-04-13 19:01:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10269 states, 10268 states have (on average 3.837748344370861) internal successors, (39406), 10268 states have internal predecessors, (39406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10269 states to 10269 states and 39406 transitions. [2025-04-13 19:01:48,688 INFO L79 Accepts]: Start accepts. Automaton has 10269 states and 39406 transitions. Word has length 54 [2025-04-13 19:01:48,688 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:48,688 INFO L485 AbstractCegarLoop]: Abstraction has 10269 states and 39406 transitions. [2025-04-13 19:01:48,688 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:48,688 INFO L278 IsEmpty]: Start isEmpty. Operand 10269 states and 39406 transitions. [2025-04-13 19:01:48,704 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:48,704 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:48,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:48,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable359 [2025-04-13 19:01:48,704 INFO L403 AbstractCegarLoop]: === Iteration 361 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:48,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash -512818210, now seen corresponding path program 361 times [2025-04-13 19:01:48,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:48,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989532736] [2025-04-13 19:01:48,705 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:01:48,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:48,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:48,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:48,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:48,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:49,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 19:01:49,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:49,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989532736] [2025-04-13 19:01:49,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989532736] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:49,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:49,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:49,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915975213] [2025-04-13 19:01:49,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:49,351 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:49,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:49,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:49,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:49,351 INFO L87 Difference]: Start difference. First operand 10269 states and 39406 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:50,456 INFO L93 Difference]: Finished difference Result 18717 states and 69360 transitions. [2025-04-13 19:01:50,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:50,457 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:50,457 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:50,528 INFO L225 Difference]: With dead ends: 18717 [2025-04-13 19:01:50,528 INFO L226 Difference]: Without dead ends: 18620 [2025-04-13 19:01:50,535 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:50,535 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 274 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:50,535 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 613 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:01:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18620 states. [2025-04-13 19:01:50,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18620 to 10243. [2025-04-13 19:01:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10243 states, 10242 states have (on average 3.8407537590314393) internal successors, (39337), 10242 states have internal predecessors, (39337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10243 states to 10243 states and 39337 transitions. [2025-04-13 19:01:50,807 INFO L79 Accepts]: Start accepts. Automaton has 10243 states and 39337 transitions. Word has length 54 [2025-04-13 19:01:50,808 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:50,808 INFO L485 AbstractCegarLoop]: Abstraction has 10243 states and 39337 transitions. [2025-04-13 19:01:50,808 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:50,808 INFO L278 IsEmpty]: Start isEmpty. Operand 10243 states and 39337 transitions. [2025-04-13 19:01:50,823 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:50,823 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:50,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:50,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360 [2025-04-13 19:01:50,824 INFO L403 AbstractCegarLoop]: === Iteration 362 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:50,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:50,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1693843092, now seen corresponding path program 362 times [2025-04-13 19:01:50,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:50,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403816211] [2025-04-13 19:01:50,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:50,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:50,826 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:50,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:50,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:01:50,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:51,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:51,408 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403816211] [2025-04-13 19:01:51,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403816211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:51,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:51,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:51,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905902482] [2025-04-13 19:01:51,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:51,408 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:51,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:51,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:51,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:51,409 INFO L87 Difference]: Start difference. First operand 10243 states and 39337 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:52,423 INFO L93 Difference]: Finished difference Result 19742 states and 72802 transitions. [2025-04-13 19:01:52,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:52,423 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:52,423 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:52,502 INFO L225 Difference]: With dead ends: 19742 [2025-04-13 19:01:52,502 INFO L226 Difference]: Without dead ends: 19644 [2025-04-13 19:01:52,510 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:52,510 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 297 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:52,510 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 600 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:01:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19644 states. [2025-04-13 19:01:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19644 to 10213. [2025-04-13 19:01:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10213 states, 10212 states have (on average 3.8442028985507246) internal successors, (39257), 10212 states have internal predecessors, (39257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10213 states to 10213 states and 39257 transitions. [2025-04-13 19:01:52,794 INFO L79 Accepts]: Start accepts. Automaton has 10213 states and 39257 transitions. Word has length 54 [2025-04-13 19:01:52,794 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:52,794 INFO L485 AbstractCegarLoop]: Abstraction has 10213 states and 39257 transitions. [2025-04-13 19:01:52,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:52,794 INFO L278 IsEmpty]: Start isEmpty. Operand 10213 states and 39257 transitions. [2025-04-13 19:01:52,810 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:52,810 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:52,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:52,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable361 [2025-04-13 19:01:52,811 INFO L403 AbstractCegarLoop]: === Iteration 363 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:52,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:52,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1883738564, now seen corresponding path program 363 times [2025-04-13 19:01:52,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:52,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386108500] [2025-04-13 19:01:52,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:01:52,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:52,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:52,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:52,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:01:52,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:53,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:53,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386108500] [2025-04-13 19:01:53,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386108500] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:53,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:53,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:53,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83630349] [2025-04-13 19:01:53,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:53,418 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:53,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:53,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:53,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:53,418 INFO L87 Difference]: Start difference. First operand 10213 states and 39257 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:54,417 INFO L93 Difference]: Finished difference Result 18613 states and 69097 transitions. [2025-04-13 19:01:54,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:54,417 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:54,417 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:54,491 INFO L225 Difference]: With dead ends: 18613 [2025-04-13 19:01:54,491 INFO L226 Difference]: Without dead ends: 18501 [2025-04-13 19:01:54,497 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:54,497 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 276 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:54,497 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 546 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:01:54,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18501 states. [2025-04-13 19:01:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18501 to 10301. [2025-04-13 19:01:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10301 states, 10300 states have (on average 3.8381553398058252) internal successors, (39533), 10300 states have internal predecessors, (39533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10301 states to 10301 states and 39533 transitions. [2025-04-13 19:01:54,803 INFO L79 Accepts]: Start accepts. Automaton has 10301 states and 39533 transitions. Word has length 54 [2025-04-13 19:01:54,804 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:54,804 INFO L485 AbstractCegarLoop]: Abstraction has 10301 states and 39533 transitions. [2025-04-13 19:01:54,804 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:54,804 INFO L278 IsEmpty]: Start isEmpty. Operand 10301 states and 39533 transitions. [2025-04-13 19:01:54,820 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:54,820 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:54,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:54,820 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable362 [2025-04-13 19:01:54,820 INFO L403 AbstractCegarLoop]: === Iteration 364 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:54,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:54,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1620588210, now seen corresponding path program 364 times [2025-04-13 19:01:54,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:54,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472786302] [2025-04-13 19:01:54,821 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:01:54,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:54,824 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:01:54,836 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:54,836 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:01:54,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:55,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:55,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:55,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472786302] [2025-04-13 19:01:55,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472786302] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:55,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:55,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:55,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819516357] [2025-04-13 19:01:55,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:55,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:55,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:55,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:55,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:55,368 INFO L87 Difference]: Start difference. First operand 10301 states and 39533 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:56,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:56,349 INFO L93 Difference]: Finished difference Result 19770 states and 72929 transitions. [2025-04-13 19:01:56,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:01:56,350 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:56,350 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:56,423 INFO L225 Difference]: With dead ends: 19770 [2025-04-13 19:01:56,423 INFO L226 Difference]: Without dead ends: 19634 [2025-04-13 19:01:56,430 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:56,430 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 318 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:56,430 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 536 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:56,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19634 states. [2025-04-13 19:01:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19634 to 10422. [2025-04-13 19:01:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10422 states, 10421 states have (on average 3.8294789367623068) internal successors, (39907), 10421 states have internal predecessors, (39907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10422 states to 10422 states and 39907 transitions. [2025-04-13 19:01:56,700 INFO L79 Accepts]: Start accepts. Automaton has 10422 states and 39907 transitions. Word has length 54 [2025-04-13 19:01:56,700 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:56,700 INFO L485 AbstractCegarLoop]: Abstraction has 10422 states and 39907 transitions. [2025-04-13 19:01:56,700 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:56,700 INFO L278 IsEmpty]: Start isEmpty. Operand 10422 states and 39907 transitions. [2025-04-13 19:01:56,715 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:56,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:56,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:56,716 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363 [2025-04-13 19:01:56,716 INFO L403 AbstractCegarLoop]: === Iteration 365 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:56,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:56,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1392559430, now seen corresponding path program 365 times [2025-04-13 19:01:56,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:56,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100596200] [2025-04-13 19:01:56,716 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:01:56,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:56,719 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:56,730 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:56,730 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:01:56,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:57,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:57,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100596200] [2025-04-13 19:01:57,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100596200] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:57,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:57,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:57,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537329169] [2025-04-13 19:01:57,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:57,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:57,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:57,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:57,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:57,324 INFO L87 Difference]: Start difference. First operand 10422 states and 39907 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:58,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:58,212 INFO L93 Difference]: Finished difference Result 18762 states and 69504 transitions. [2025-04-13 19:01:58,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:58,213 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:01:58,213 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:58,280 INFO L225 Difference]: With dead ends: 18762 [2025-04-13 19:01:58,281 INFO L226 Difference]: Without dead ends: 18698 [2025-04-13 19:01:58,287 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:58,287 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 323 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:58,287 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 531 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:01:58,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18698 states. [2025-04-13 19:01:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18698 to 10430. [2025-04-13 19:01:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10430 states, 10429 states have (on average 3.828459104420366) internal successors, (39927), 10429 states have internal predecessors, (39927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:58,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10430 states to 10430 states and 39927 transitions. [2025-04-13 19:01:58,544 INFO L79 Accepts]: Start accepts. Automaton has 10430 states and 39927 transitions. Word has length 54 [2025-04-13 19:01:58,544 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:58,544 INFO L485 AbstractCegarLoop]: Abstraction has 10430 states and 39927 transitions. [2025-04-13 19:01:58,544 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:58,544 INFO L278 IsEmpty]: Start isEmpty. Operand 10430 states and 39927 transitions. [2025-04-13 19:01:58,560 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:01:58,560 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:58,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:58,560 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable364 [2025-04-13 19:01:58,560 INFO L403 AbstractCegarLoop]: === Iteration 366 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:01:58,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:58,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1625507814, now seen corresponding path program 366 times [2025-04-13 19:01:58,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:58,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554233970] [2025-04-13 19:01:58,560 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:01:58,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:58,563 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:01:58,572 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:01:58,572 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:01:58,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:59,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:59,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554233970] [2025-04-13 19:01:59,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554233970] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:59,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:59,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:01:59,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312129926] [2025-04-13 19:01:59,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:59,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:59,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:59,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:59,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:59,215 INFO L87 Difference]: Start difference. First operand 10430 states and 39927 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:00,213 INFO L93 Difference]: Finished difference Result 19794 states and 72939 transitions. [2025-04-13 19:02:00,213 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:02:00,214 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:00,214 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:00,280 INFO L225 Difference]: With dead ends: 19794 [2025-04-13 19:02:00,280 INFO L226 Difference]: Without dead ends: 19724 [2025-04-13 19:02:00,286 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:02:00,286 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 300 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:00,286 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 606 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:02:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19724 states. [2025-04-13 19:02:00,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19724 to 10441. [2025-04-13 19:02:00,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10441 states, 10440 states have (on average 3.8270114942528735) internal successors, (39954), 10440 states have internal predecessors, (39954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10441 states to 10441 states and 39954 transitions. [2025-04-13 19:02:00,533 INFO L79 Accepts]: Start accepts. Automaton has 10441 states and 39954 transitions. Word has length 54 [2025-04-13 19:02:00,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:00,534 INFO L485 AbstractCegarLoop]: Abstraction has 10441 states and 39954 transitions. [2025-04-13 19:02:00,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:00,534 INFO L278 IsEmpty]: Start isEmpty. Operand 10441 states and 39954 transitions. [2025-04-13 19:02:00,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:00,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:00,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:00,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable365 [2025-04-13 19:02:00,550 INFO L403 AbstractCegarLoop]: === Iteration 367 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:00,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:00,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2131929884, now seen corresponding path program 367 times [2025-04-13 19:02:00,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:00,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317957857] [2025-04-13 19:02:00,550 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:02:00,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:00,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:00,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:00,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:02:00,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:01,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:01,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317957857] [2025-04-13 19:02:01,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317957857] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:01,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:01,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:01,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212422510] [2025-04-13 19:02:01,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:01,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:01,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:01,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:01,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:01,128 INFO L87 Difference]: Start difference. First operand 10441 states and 39954 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:02,055 INFO L93 Difference]: Finished difference Result 18709 states and 69362 transitions. [2025-04-13 19:02:02,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:02:02,055 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:02,055 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:02,118 INFO L225 Difference]: With dead ends: 18709 [2025-04-13 19:02:02,118 INFO L226 Difference]: Without dead ends: 18609 [2025-04-13 19:02:02,125 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:02:02,125 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 278 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:02,125 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 506 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:02,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18609 states. [2025-04-13 19:02:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18609 to 10409. [2025-04-13 19:02:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10409 states, 10408 states have (on average 3.8287855495772485) internal successors, (39850), 10408 states have internal predecessors, (39850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10409 states to 10409 states and 39850 transitions. [2025-04-13 19:02:02,350 INFO L79 Accepts]: Start accepts. Automaton has 10409 states and 39850 transitions. Word has length 54 [2025-04-13 19:02:02,351 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:02,351 INFO L485 AbstractCegarLoop]: Abstraction has 10409 states and 39850 transitions. [2025-04-13 19:02:02,351 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:02,351 INFO L278 IsEmpty]: Start isEmpty. Operand 10409 states and 39850 transitions. [2025-04-13 19:02:02,366 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:02,367 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:02,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] [2025-04-13 19:02:02,367 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable366 [2025-04-13 19:02:02,367 INFO L403 AbstractCegarLoop]: === Iteration 368 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:02,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash -155920132, now seen corresponding path program 368 times [2025-04-13 19:02:02,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:02,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950846603] [2025-04-13 19:02:02,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:02:02,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:02,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:02,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:02,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:02:02,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:02,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:02,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950846603] [2025-04-13 19:02:02,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950846603] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:02,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:02,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:02,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120345523] [2025-04-13 19:02:02,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:02,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:02,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:02,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:02,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:02,986 INFO L87 Difference]: Start difference. First operand 10409 states and 39850 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:03,884 INFO L93 Difference]: Finished difference Result 19692 states and 72646 transitions. [2025-04-13 19:02:03,884 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:02:03,884 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:03,885 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:03,952 INFO L225 Difference]: With dead ends: 19692 [2025-04-13 19:02:03,953 INFO L226 Difference]: Without dead ends: 19577 [2025-04-13 19:02:03,958 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:02:03,959 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 290 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:03,959 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 562 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:03,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19577 states. [2025-04-13 19:02:04,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19577 to 10365. [2025-04-13 19:02:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10365 states, 10364 states have (on average 3.831435739096874) internal successors, (39709), 10364 states have internal predecessors, (39709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10365 states to 10365 states and 39709 transitions. [2025-04-13 19:02:04,256 INFO L79 Accepts]: Start accepts. Automaton has 10365 states and 39709 transitions. Word has length 54 [2025-04-13 19:02:04,257 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:04,257 INFO L485 AbstractCegarLoop]: Abstraction has 10365 states and 39709 transitions. [2025-04-13 19:02:04,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:04,257 INFO L278 IsEmpty]: Start isEmpty. Operand 10365 states and 39709 transitions. [2025-04-13 19:02:04,272 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:04,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:04,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:04,273 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable367 [2025-04-13 19:02:04,273 INFO L403 AbstractCegarLoop]: === Iteration 369 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:04,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:04,273 INFO L85 PathProgramCache]: Analyzing trace with hash -643204480, now seen corresponding path program 369 times [2025-04-13 19:02:04,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:04,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383494224] [2025-04-13 19:02:04,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:02:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:04,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:04,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:04,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:02:04,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:04,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 19:02:04,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:04,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383494224] [2025-04-13 19:02:04,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383494224] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:04,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:04,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:04,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291393244] [2025-04-13 19:02:04,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:04,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:04,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:04,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:04,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:04,877 INFO L87 Difference]: Start difference. First operand 10365 states and 39709 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:05,832 INFO L93 Difference]: Finished difference Result 18669 states and 69233 transitions. [2025-04-13 19:02:05,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:02:05,833 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:05,833 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:05,899 INFO L225 Difference]: With dead ends: 18669 [2025-04-13 19:02:05,899 INFO L226 Difference]: Without dead ends: 18605 [2025-04-13 19:02:05,905 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:02:05,905 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 288 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:05,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 532 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18605 states. [2025-04-13 19:02:06,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18605 to 10389. [2025-04-13 19:02:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10389 states, 10388 states have (on average 3.829899884482095) internal successors, (39785), 10388 states have internal predecessors, (39785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10389 states to 10389 states and 39785 transitions. [2025-04-13 19:02:06,142 INFO L79 Accepts]: Start accepts. Automaton has 10389 states and 39785 transitions. Word has length 54 [2025-04-13 19:02:06,142 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:06,142 INFO L485 AbstractCegarLoop]: Abstraction has 10389 states and 39785 transitions. [2025-04-13 19:02:06,142 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:06,142 INFO L278 IsEmpty]: Start isEmpty. Operand 10389 states and 39785 transitions. [2025-04-13 19:02:06,158 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:06,158 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:06,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:06,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable368 [2025-04-13 19:02:06,159 INFO L403 AbstractCegarLoop]: === Iteration 370 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:06,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:06,159 INFO L85 PathProgramCache]: Analyzing trace with hash 468148976, now seen corresponding path program 370 times [2025-04-13 19:02:06,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:06,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528809223] [2025-04-13 19:02:06,159 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:02:06,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:06,162 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:02:06,175 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:06,175 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:02:06,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:06,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:06,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528809223] [2025-04-13 19:02:06,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528809223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:06,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:06,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:06,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311968597] [2025-04-13 19:02:06,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:06,774 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:06,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:06,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:06,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:06,774 INFO L87 Difference]: Start difference. First operand 10389 states and 39785 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:07,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:07,560 INFO L93 Difference]: Finished difference Result 19717 states and 72724 transitions. [2025-04-13 19:02:07,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:02:07,561 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:07,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:07,626 INFO L225 Difference]: With dead ends: 19717 [2025-04-13 19:02:07,626 INFO L226 Difference]: Without dead ends: 19647 [2025-04-13 19:02:07,632 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:02:07,632 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 344 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:07,632 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 535 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 19:02:07,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19647 states. [2025-04-13 19:02:07,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19647 to 10422. [2025-04-13 19:02:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10422 states, 10421 states have (on average 3.827655695230784) internal successors, (39888), 10421 states have internal predecessors, (39888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10422 states to 10422 states and 39888 transitions. [2025-04-13 19:02:07,876 INFO L79 Accepts]: Start accepts. Automaton has 10422 states and 39888 transitions. Word has length 54 [2025-04-13 19:02:07,876 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:07,876 INFO L485 AbstractCegarLoop]: Abstraction has 10422 states and 39888 transitions. [2025-04-13 19:02:07,876 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:07,876 INFO L278 IsEmpty]: Start isEmpty. Operand 10422 states and 39888 transitions. [2025-04-13 19:02:07,892 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:07,892 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:07,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:07,892 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable369 [2025-04-13 19:02:07,893 INFO L403 AbstractCegarLoop]: === Iteration 371 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:07,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:07,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1413682462, now seen corresponding path program 371 times [2025-04-13 19:02:07,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:07,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43848160] [2025-04-13 19:02:07,893 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:02:07,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:07,895 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:07,907 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:07,907 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:02:07,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:08,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 19:02:08,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:08,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43848160] [2025-04-13 19:02:08,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43848160] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:08,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:08,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:08,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245865233] [2025-04-13 19:02:08,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:08,510 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:08,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:08,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:08,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:08,510 INFO L87 Difference]: Start difference. First operand 10422 states and 39888 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:09,425 INFO L93 Difference]: Finished difference Result 18706 states and 69340 transitions. [2025-04-13 19:02:09,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:02:09,425 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:09,426 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:09,490 INFO L225 Difference]: With dead ends: 18706 [2025-04-13 19:02:09,490 INFO L226 Difference]: Without dead ends: 18630 [2025-04-13 19:02:09,495 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:02:09,495 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 285 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:09,496 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 505 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18630 states. [2025-04-13 19:02:09,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18630 to 10414. [2025-04-13 19:02:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10414 states, 10413 states have (on average 3.8279074234130412) internal successors, (39860), 10413 states have internal predecessors, (39860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10414 states to 10414 states and 39860 transitions. [2025-04-13 19:02:09,747 INFO L79 Accepts]: Start accepts. Automaton has 10414 states and 39860 transitions. Word has length 54 [2025-04-13 19:02:09,747 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:09,747 INFO L485 AbstractCegarLoop]: Abstraction has 10414 states and 39860 transitions. [2025-04-13 19:02:09,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:09,747 INFO L278 IsEmpty]: Start isEmpty. Operand 10414 states and 39860 transitions. [2025-04-13 19:02:09,762 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:09,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:09,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] [2025-04-13 19:02:09,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable370 [2025-04-13 19:02:09,763 INFO L403 AbstractCegarLoop]: === Iteration 372 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:09,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:09,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1937736658, now seen corresponding path program 372 times [2025-04-13 19:02:09,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:09,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296688419] [2025-04-13 19:02:09,763 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:02:09,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:09,765 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:09,775 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:09,775 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:02:09,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:10,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 19:02:10,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:10,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296688419] [2025-04-13 19:02:10,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296688419] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:10,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:10,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:10,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196906735] [2025-04-13 19:02:10,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:10,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:10,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:10,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:10,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:10,388 INFO L87 Difference]: Start difference. First operand 10414 states and 39860 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:11,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:11,354 INFO L93 Difference]: Finished difference Result 19710 states and 72687 transitions. [2025-04-13 19:02:11,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:02:11,354 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:11,354 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:11,419 INFO L225 Difference]: With dead ends: 19710 [2025-04-13 19:02:11,420 INFO L226 Difference]: Without dead ends: 19628 [2025-04-13 19:02:11,426 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:02:11,427 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 331 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:11,427 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 524 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19628 states. [2025-04-13 19:02:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19628 to 10403. [2025-04-13 19:02:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10403 states, 10402 states have (on average 3.828302249567391) internal successors, (39822), 10402 states have internal predecessors, (39822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10403 states to 10403 states and 39822 transitions. [2025-04-13 19:02:11,671 INFO L79 Accepts]: Start accepts. Automaton has 10403 states and 39822 transitions. Word has length 54 [2025-04-13 19:02:11,671 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:11,671 INFO L485 AbstractCegarLoop]: Abstraction has 10403 states and 39822 transitions. [2025-04-13 19:02:11,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:11,671 INFO L278 IsEmpty]: Start isEmpty. Operand 10403 states and 39822 transitions. [2025-04-13 19:02:11,687 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:11,687 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:11,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:11,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable371 [2025-04-13 19:02:11,687 INFO L403 AbstractCegarLoop]: === Iteration 373 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:11,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:11,688 INFO L85 PathProgramCache]: Analyzing trace with hash 194632720, now seen corresponding path program 373 times [2025-04-13 19:02:11,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:11,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378825411] [2025-04-13 19:02:11,688 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:02:11,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:11,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:11,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:11,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:02:11,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:12,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 19:02:12,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:12,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378825411] [2025-04-13 19:02:12,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378825411] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:12,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:12,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:12,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258433102] [2025-04-13 19:02:12,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:12,285 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:12,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:12,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:12,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:12,285 INFO L87 Difference]: Start difference. First operand 10403 states and 39822 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:13,164 INFO L93 Difference]: Finished difference Result 18619 states and 69101 transitions. [2025-04-13 19:02:13,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:02:13,164 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:13,164 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:13,235 INFO L225 Difference]: With dead ends: 18619 [2025-04-13 19:02:13,235 INFO L226 Difference]: Without dead ends: 18431 [2025-04-13 19:02:13,240 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:02:13,241 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 259 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:13,241 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 471 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:13,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18431 states. [2025-04-13 19:02:13,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18431 to 10323. [2025-04-13 19:02:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10323 states, 10322 states have (on average 3.8316217787250535) internal successors, (39550), 10322 states have internal predecessors, (39550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10323 states to 10323 states and 39550 transitions. [2025-04-13 19:02:13,535 INFO L79 Accepts]: Start accepts. Automaton has 10323 states and 39550 transitions. Word has length 54 [2025-04-13 19:02:13,535 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:13,535 INFO L485 AbstractCegarLoop]: Abstraction has 10323 states and 39550 transitions. [2025-04-13 19:02:13,536 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:13,536 INFO L278 IsEmpty]: Start isEmpty. Operand 10323 states and 39550 transitions. [2025-04-13 19:02:13,552 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:13,552 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:13,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] [2025-04-13 19:02:13,552 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable372 [2025-04-13 19:02:13,552 INFO L403 AbstractCegarLoop]: === Iteration 374 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:13,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:13,553 INFO L85 PathProgramCache]: Analyzing trace with hash 245557376, now seen corresponding path program 374 times [2025-04-13 19:02:13,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:13,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505204873] [2025-04-13 19:02:13,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:02:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:13,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:13,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:13,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:02:13,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:14,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:14,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505204873] [2025-04-13 19:02:14,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505204873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:14,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:14,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:14,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799843620] [2025-04-13 19:02:14,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:14,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:14,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:14,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:14,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:14,188 INFO L87 Difference]: Start difference. First operand 10323 states and 39550 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:15,162 INFO L93 Difference]: Finished difference Result 19548 states and 72197 transitions. [2025-04-13 19:02:15,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:02:15,162 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:15,162 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:15,231 INFO L225 Difference]: With dead ends: 19548 [2025-04-13 19:02:15,231 INFO L226 Difference]: Without dead ends: 19321 [2025-04-13 19:02:15,237 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:02:15,237 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 260 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:15,237 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 557 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19321 states. [2025-04-13 19:02:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19321 to 10213. [2025-04-13 19:02:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10213 states, 10212 states have (on average 3.8371523697610654) internal successors, (39185), 10212 states have internal predecessors, (39185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10213 states to 10213 states and 39185 transitions. [2025-04-13 19:02:15,476 INFO L79 Accepts]: Start accepts. Automaton has 10213 states and 39185 transitions. Word has length 54 [2025-04-13 19:02:15,476 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:15,476 INFO L485 AbstractCegarLoop]: Abstraction has 10213 states and 39185 transitions. [2025-04-13 19:02:15,476 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:15,476 INFO L278 IsEmpty]: Start isEmpty. Operand 10213 states and 39185 transitions. [2025-04-13 19:02:15,491 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:15,492 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:15,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:15,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable373 [2025-04-13 19:02:15,492 INFO L403 AbstractCegarLoop]: === Iteration 375 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:15,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:15,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1279093920, now seen corresponding path program 375 times [2025-04-13 19:02:15,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:15,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079008999] [2025-04-13 19:02:15,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:02:15,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:15,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:15,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:15,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:02:15,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:16,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:16,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:16,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079008999] [2025-04-13 19:02:16,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079008999] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:16,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:16,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:16,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500502731] [2025-04-13 19:02:16,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:16,097 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:16,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:16,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:16,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:16,098 INFO L87 Difference]: Start difference. First operand 10213 states and 39185 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:16,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:16,961 INFO L93 Difference]: Finished difference Result 18674 states and 69170 transitions. [2025-04-13 19:02:16,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:02:16,961 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:16,962 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:17,030 INFO L225 Difference]: With dead ends: 18674 [2025-04-13 19:02:17,030 INFO L226 Difference]: Without dead ends: 18610 [2025-04-13 19:02:17,036 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:02:17,036 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 295 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:17,036 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 533 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18610 states. [2025-04-13 19:02:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18610 to 10233. [2025-04-13 19:02:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10233 states, 10232 states have (on average 3.8362978889757624) internal successors, (39253), 10232 states have internal predecessors, (39253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10233 states to 10233 states and 39253 transitions. [2025-04-13 19:02:17,265 INFO L79 Accepts]: Start accepts. Automaton has 10233 states and 39253 transitions. Word has length 54 [2025-04-13 19:02:17,265 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:17,265 INFO L485 AbstractCegarLoop]: Abstraction has 10233 states and 39253 transitions. [2025-04-13 19:02:17,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:17,265 INFO L278 IsEmpty]: Start isEmpty. Operand 10233 states and 39253 transitions. [2025-04-13 19:02:17,280 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:17,280 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:17,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:17,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable374 [2025-04-13 19:02:17,280 INFO L403 AbstractCegarLoop]: === Iteration 376 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:17,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:17,281 INFO L85 PathProgramCache]: Analyzing trace with hash -89235188, now seen corresponding path program 376 times [2025-04-13 19:02:17,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:17,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509546119] [2025-04-13 19:02:17,281 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:02:17,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:17,283 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:02:17,295 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:17,295 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:02:17,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:17,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:17,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509546119] [2025-04-13 19:02:17,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509546119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:17,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:17,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:17,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096770868] [2025-04-13 19:02:17,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:17,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:17,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:17,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:17,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:17,943 INFO L87 Difference]: Start difference. First operand 10233 states and 39253 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:18,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:18,817 INFO L93 Difference]: Finished difference Result 19741 states and 72725 transitions. [2025-04-13 19:02:18,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:02:18,817 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:18,817 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:18,884 INFO L225 Difference]: With dead ends: 19741 [2025-04-13 19:02:18,884 INFO L226 Difference]: Without dead ends: 19671 [2025-04-13 19:02:18,890 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:02:18,890 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 298 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:18,890 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 609 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19671 states. [2025-04-13 19:02:19,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19671 to 10259. [2025-04-13 19:02:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10259 states, 10258 states have (on average 3.83505556638721) internal successors, (39340), 10258 states have internal predecessors, (39340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10259 states to 10259 states and 39340 transitions. [2025-04-13 19:02:19,131 INFO L79 Accepts]: Start accepts. Automaton has 10259 states and 39340 transitions. Word has length 54 [2025-04-13 19:02:19,132 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:19,132 INFO L485 AbstractCegarLoop]: Abstraction has 10259 states and 39340 transitions. [2025-04-13 19:02:19,132 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:19,132 INFO L278 IsEmpty]: Start isEmpty. Operand 10259 states and 39340 transitions. [2025-04-13 19:02:19,147 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:19,148 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:19,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:19,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable375 [2025-04-13 19:02:19,148 INFO L403 AbstractCegarLoop]: === Iteration 377 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:19,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:19,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2124808448, now seen corresponding path program 377 times [2025-04-13 19:02:19,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:19,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100733561] [2025-04-13 19:02:19,148 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:02:19,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:19,151 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:19,161 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:19,161 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:02:19,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:19,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 19:02:19,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:19,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100733561] [2025-04-13 19:02:19,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100733561] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:19,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:19,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:19,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004945296] [2025-04-13 19:02:19,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:19,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:19,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:19,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:19,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:19,757 INFO L87 Difference]: Start difference. First operand 10259 states and 39340 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:20,634 INFO L93 Difference]: Finished difference Result 18704 states and 69261 transitions. [2025-04-13 19:02:20,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:02:20,634 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:20,634 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:20,698 INFO L225 Difference]: With dead ends: 18704 [2025-04-13 19:02:20,698 INFO L226 Difference]: Without dead ends: 18628 [2025-04-13 19:02:20,704 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:02:20,704 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 328 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:20,704 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 527 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18628 states. [2025-04-13 19:02:20,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18628 to 10251. [2025-04-13 19:02:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10251 states, 10250 states have (on average 3.8357073170731706) internal successors, (39316), 10250 states have internal predecessors, (39316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10251 states to 10251 states and 39316 transitions. [2025-04-13 19:02:20,934 INFO L79 Accepts]: Start accepts. Automaton has 10251 states and 39316 transitions. Word has length 54 [2025-04-13 19:02:20,934 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:20,935 INFO L485 AbstractCegarLoop]: Abstraction has 10251 states and 39316 transitions. [2025-04-13 19:02:20,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:20,935 INFO L278 IsEmpty]: Start isEmpty. Operand 10251 states and 39316 transitions. [2025-04-13 19:02:20,950 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:20,950 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:20,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:20,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable376 [2025-04-13 19:02:20,950 INFO L403 AbstractCegarLoop]: === Iteration 378 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:20,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:20,951 INFO L85 PathProgramCache]: Analyzing trace with hash -381811782, now seen corresponding path program 378 times [2025-04-13 19:02:20,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:20,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367771148] [2025-04-13 19:02:20,951 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:02:20,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:20,953 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:20,962 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:20,962 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:02:20,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:21,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:21,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367771148] [2025-04-13 19:02:21,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367771148] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:21,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:21,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:21,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99271420] [2025-04-13 19:02:21,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:21,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:21,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:21,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:21,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:21,540 INFO L87 Difference]: Start difference. First operand 10251 states and 39316 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:22,660 INFO L93 Difference]: Finished difference Result 19734 states and 72692 transitions. [2025-04-13 19:02:22,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:02:22,660 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:22,660 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:22,726 INFO L225 Difference]: With dead ends: 19734 [2025-04-13 19:02:22,726 INFO L226 Difference]: Without dead ends: 19652 [2025-04-13 19:02:22,729 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:02:22,729 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 296 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1730 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 1756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:22,729 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 644 Invalid, 1756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1730 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:02:22,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19652 states. [2025-04-13 19:02:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19652 to 10240. [2025-04-13 19:02:22,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10240 states, 10239 states have (on average 3.836702803008106) internal successors, (39284), 10239 states have internal predecessors, (39284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10240 states to 10240 states and 39284 transitions. [2025-04-13 19:02:22,956 INFO L79 Accepts]: Start accepts. Automaton has 10240 states and 39284 transitions. Word has length 54 [2025-04-13 19:02:22,957 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:22,957 INFO L485 AbstractCegarLoop]: Abstraction has 10240 states and 39284 transitions. [2025-04-13 19:02:22,957 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:22,957 INFO L278 IsEmpty]: Start isEmpty. Operand 10240 states and 39284 transitions. [2025-04-13 19:02:22,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:22,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:22,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:22,972 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable377 [2025-04-13 19:02:22,972 INFO L403 AbstractCegarLoop]: === Iteration 379 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:22,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:22,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1116295808, now seen corresponding path program 379 times [2025-04-13 19:02:22,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:22,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94856298] [2025-04-13 19:02:22,973 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:02:22,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:22,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:22,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:22,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:02:22,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:23,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:23,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94856298] [2025-04-13 19:02:23,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94856298] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:23,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:23,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:23,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821071418] [2025-04-13 19:02:23,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:23,565 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:23,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:23,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:23,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:23,566 INFO L87 Difference]: Start difference. First operand 10240 states and 39284 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:24,403 INFO L93 Difference]: Finished difference Result 18645 states and 69116 transitions. [2025-04-13 19:02:24,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 19:02:24,403 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:24,404 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:24,469 INFO L225 Difference]: With dead ends: 18645 [2025-04-13 19:02:24,469 INFO L226 Difference]: Without dead ends: 18581 [2025-04-13 19:02:24,475 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2025-04-13 19:02:24,475 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 349 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:24,475 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 468 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 19:02:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18581 states. [2025-04-13 19:02:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18581 to 10248. [2025-04-13 19:02:24,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10248 states, 10247 states have (on average 3.835659217331902) internal successors, (39304), 10247 states have internal predecessors, (39304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10248 states to 10248 states and 39304 transitions. [2025-04-13 19:02:24,790 INFO L79 Accepts]: Start accepts. Automaton has 10248 states and 39304 transitions. Word has length 54 [2025-04-13 19:02:24,790 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:24,790 INFO L485 AbstractCegarLoop]: Abstraction has 10248 states and 39304 transitions. [2025-04-13 19:02:24,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:24,790 INFO L278 IsEmpty]: Start isEmpty. Operand 10248 states and 39304 transitions. [2025-04-13 19:02:24,805 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:24,805 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:24,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:24,805 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable378 [2025-04-13 19:02:24,805 INFO L403 AbstractCegarLoop]: === Iteration 380 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:24,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:24,806 INFO L85 PathProgramCache]: Analyzing trace with hash -83983636, now seen corresponding path program 380 times [2025-04-13 19:02:24,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:24,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944231655] [2025-04-13 19:02:24,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:02:24,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:24,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:24,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:24,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:02:24,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:25,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 19:02:25,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:25,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944231655] [2025-04-13 19:02:25,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944231655] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:25,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:25,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:25,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109354026] [2025-04-13 19:02:25,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:25,393 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:25,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:25,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:25,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:25,393 INFO L87 Difference]: Start difference. First operand 10248 states and 39304 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:26,456 INFO L93 Difference]: Finished difference Result 19703 states and 72628 transitions. [2025-04-13 19:02:26,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 19:02:26,456 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:26,456 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:26,525 INFO L225 Difference]: With dead ends: 19703 [2025-04-13 19:02:26,526 INFO L226 Difference]: Without dead ends: 19633 [2025-04-13 19:02:26,532 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2025-04-13 19:02:26,533 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 301 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:26,533 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 578 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:02:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19633 states. [2025-04-13 19:02:26,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19633 to 10258. [2025-04-13 19:02:26,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10258 states, 10257 states have (on average 3.834357024471093) internal successors, (39329), 10257 states have internal predecessors, (39329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10258 states to 10258 states and 39329 transitions. [2025-04-13 19:02:26,773 INFO L79 Accepts]: Start accepts. Automaton has 10258 states and 39329 transitions. Word has length 54 [2025-04-13 19:02:26,773 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:26,773 INFO L485 AbstractCegarLoop]: Abstraction has 10258 states and 39329 transitions. [2025-04-13 19:02:26,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:26,774 INFO L278 IsEmpty]: Start isEmpty. Operand 10258 states and 39329 transitions. [2025-04-13 19:02:26,789 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:26,789 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:26,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:26,789 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable379 [2025-04-13 19:02:26,789 INFO L403 AbstractCegarLoop]: === Iteration 381 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:26,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:26,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1204140800, now seen corresponding path program 381 times [2025-04-13 19:02:26,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:26,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542531189] [2025-04-13 19:02:26,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:02:26,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:26,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:26,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:26,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:02:26,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:27,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:27,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542531189] [2025-04-13 19:02:27,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542531189] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:27,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:27,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:27,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590391978] [2025-04-13 19:02:27,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:27,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:27,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:27,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:27,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:27,376 INFO L87 Difference]: Start difference. First operand 10258 states and 39329 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:28,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:28,218 INFO L93 Difference]: Finished difference Result 18614 states and 69008 transitions. [2025-04-13 19:02:28,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:02:28,218 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:28,219 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:28,285 INFO L225 Difference]: With dead ends: 18614 [2025-04-13 19:02:28,285 INFO L226 Difference]: Without dead ends: 18535 [2025-04-13 19:02:28,291 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2025-04-13 19:02:28,291 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 303 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:28,291 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 542 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 19:02:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18535 states. [2025-04-13 19:02:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18535 to 10250. [2025-04-13 19:02:28,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10250 states, 10249 states have (on average 3.835008293492048) internal successors, (39305), 10249 states have internal predecessors, (39305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:28,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10250 states to 10250 states and 39305 transitions. [2025-04-13 19:02:28,528 INFO L79 Accepts]: Start accepts. Automaton has 10250 states and 39305 transitions. Word has length 54 [2025-04-13 19:02:28,528 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:28,528 INFO L485 AbstractCegarLoop]: Abstraction has 10250 states and 39305 transitions. [2025-04-13 19:02:28,529 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:28,529 INFO L278 IsEmpty]: Start isEmpty. Operand 10250 states and 39305 transitions. [2025-04-13 19:02:28,546 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:28,547 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:28,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:28,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable380 [2025-04-13 19:02:28,547 INFO L403 AbstractCegarLoop]: === Iteration 382 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:28,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash -64483106, now seen corresponding path program 382 times [2025-04-13 19:02:28,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:28,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62075609] [2025-04-13 19:02:28,547 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:02:28,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:28,551 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:02:28,565 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:28,565 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:02:28,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:29,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 19:02:29,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:29,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62075609] [2025-04-13 19:02:29,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62075609] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:29,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:29,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:29,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325703680] [2025-04-13 19:02:29,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:29,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:29,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:29,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:29,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:29,168 INFO L87 Difference]: Start difference. First operand 10250 states and 39305 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:30,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:30,053 INFO L93 Difference]: Finished difference Result 19627 states and 72394 transitions. [2025-04-13 19:02:30,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:02:30,053 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:30,054 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:30,118 INFO L225 Difference]: With dead ends: 19627 [2025-04-13 19:02:30,118 INFO L226 Difference]: Without dead ends: 19549 [2025-04-13 19:02:30,124 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2025-04-13 19:02:30,124 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 307 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:30,124 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 525 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:30,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19549 states. [2025-04-13 19:02:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19549 to 10240. [2025-04-13 19:02:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10240 states, 10239 states have (on average 3.835823810919035) internal successors, (39275), 10239 states have internal predecessors, (39275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10240 states to 10240 states and 39275 transitions. [2025-04-13 19:02:30,362 INFO L79 Accepts]: Start accepts. Automaton has 10240 states and 39275 transitions. Word has length 54 [2025-04-13 19:02:30,362 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:30,362 INFO L485 AbstractCegarLoop]: Abstraction has 10240 states and 39275 transitions. [2025-04-13 19:02:30,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:30,362 INFO L278 IsEmpty]: Start isEmpty. Operand 10240 states and 39275 transitions. [2025-04-13 19:02:30,377 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:30,377 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:30,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:30,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381 [2025-04-13 19:02:30,378 INFO L403 AbstractCegarLoop]: === Iteration 383 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:30,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:30,378 INFO L85 PathProgramCache]: Analyzing trace with hash 486752416, now seen corresponding path program 383 times [2025-04-13 19:02:30,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:30,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431173837] [2025-04-13 19:02:30,378 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:02:30,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:30,381 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:30,391 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:30,392 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:02:30,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:30,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:30,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431173837] [2025-04-13 19:02:30,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431173837] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:30,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:30,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:30,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682645081] [2025-04-13 19:02:30,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:30,941 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:30,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:30,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:30,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:30,942 INFO L87 Difference]: Start difference. First operand 10240 states and 39275 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:31,834 INFO L93 Difference]: Finished difference Result 18694 states and 69222 transitions. [2025-04-13 19:02:31,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:02:31,834 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:31,834 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:31,898 INFO L225 Difference]: With dead ends: 18694 [2025-04-13 19:02:31,898 INFO L226 Difference]: Without dead ends: 18626 [2025-04-13 19:02:31,905 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:02:31,905 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 336 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:31,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 553 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:31,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18626 states. [2025-04-13 19:02:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18626 to 10250. [2025-04-13 19:02:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10250 states, 10249 states have (on average 3.8345204410186358) internal successors, (39300), 10249 states have internal predecessors, (39300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10250 states to 10250 states and 39300 transitions. [2025-04-13 19:02:32,128 INFO L79 Accepts]: Start accepts. Automaton has 10250 states and 39300 transitions. Word has length 54 [2025-04-13 19:02:32,128 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:32,128 INFO L485 AbstractCegarLoop]: Abstraction has 10250 states and 39300 transitions. [2025-04-13 19:02:32,128 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:32,128 INFO L278 IsEmpty]: Start isEmpty. Operand 10250 states and 39300 transitions. [2025-04-13 19:02:32,143 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:32,143 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:32,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:32,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable382 [2025-04-13 19:02:32,144 INFO L403 AbstractCegarLoop]: === Iteration 384 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:32,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:32,144 INFO L85 PathProgramCache]: Analyzing trace with hash 554819626, now seen corresponding path program 384 times [2025-04-13 19:02:32,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:32,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776233913] [2025-04-13 19:02:32,144 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:02:32,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:32,147 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:32,156 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:32,156 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:02:32,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:32,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:32,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776233913] [2025-04-13 19:02:32,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776233913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:32,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:32,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:32,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565220057] [2025-04-13 19:02:32,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:32,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:32,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:32,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:32,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:32,742 INFO L87 Difference]: Start difference. First operand 10250 states and 39300 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:33,730 INFO L93 Difference]: Finished difference Result 19731 states and 72671 transitions. [2025-04-13 19:02:33,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:02:33,732 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:33,732 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:33,800 INFO L225 Difference]: With dead ends: 19731 [2025-04-13 19:02:33,800 INFO L226 Difference]: Without dead ends: 19660 [2025-04-13 19:02:33,806 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:02:33,807 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 328 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:33,807 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 595 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:33,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19660 states. [2025-04-13 19:02:34,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19660 to 10260. [2025-04-13 19:02:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10260 states, 10259 states have (on average 3.833219612047958) internal successors, (39325), 10259 states have internal predecessors, (39325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10260 states to 10260 states and 39325 transitions. [2025-04-13 19:02:34,107 INFO L79 Accepts]: Start accepts. Automaton has 10260 states and 39325 transitions. Word has length 54 [2025-04-13 19:02:34,107 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:34,107 INFO L485 AbstractCegarLoop]: Abstraction has 10260 states and 39325 transitions. [2025-04-13 19:02:34,107 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:34,107 INFO L278 IsEmpty]: Start isEmpty. Operand 10260 states and 39325 transitions. [2025-04-13 19:02:34,122 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:34,122 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:34,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:34,123 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable383 [2025-04-13 19:02:34,123 INFO L403 AbstractCegarLoop]: === Iteration 385 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:34,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:34,123 INFO L85 PathProgramCache]: Analyzing trace with hash 481500864, now seen corresponding path program 385 times [2025-04-13 19:02:34,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:34,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823639313] [2025-04-13 19:02:34,124 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:02:34,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:34,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:34,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:34,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:02:34,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:34,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:34,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:34,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823639313] [2025-04-13 19:02:34,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823639313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:34,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:34,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:34,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739024549] [2025-04-13 19:02:34,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:34,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:34,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:34,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:34,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:34,706 INFO L87 Difference]: Start difference. First operand 10260 states and 39325 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:35,566 INFO L93 Difference]: Finished difference Result 18684 states and 69177 transitions. [2025-04-13 19:02:35,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:02:35,566 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:35,566 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:35,629 INFO L225 Difference]: With dead ends: 18684 [2025-04-13 19:02:35,629 INFO L226 Difference]: Without dead ends: 18599 [2025-04-13 19:02:35,636 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:02:35,636 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 305 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:35,636 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 541 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:35,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18599 states. [2025-04-13 19:02:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18599 to 10246. [2025-04-13 19:02:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10246 states, 10245 states have (on average 3.8348462664714495) internal successors, (39288), 10245 states have internal predecessors, (39288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10246 states to 10246 states and 39288 transitions. [2025-04-13 19:02:35,876 INFO L79 Accepts]: Start accepts. Automaton has 10246 states and 39288 transitions. Word has length 54 [2025-04-13 19:02:35,876 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:35,876 INFO L485 AbstractCegarLoop]: Abstraction has 10246 states and 39288 transitions. [2025-04-13 19:02:35,876 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:35,876 INFO L278 IsEmpty]: Start isEmpty. Operand 10246 states and 39288 transitions. [2025-04-13 19:02:35,892 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:35,892 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:35,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:35,892 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable384 [2025-04-13 19:02:35,892 INFO L403 AbstractCegarLoop]: === Iteration 386 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:35,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash -414842294, now seen corresponding path program 386 times [2025-04-13 19:02:35,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:35,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954755899] [2025-04-13 19:02:35,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:02:35,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:35,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:35,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:35,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:02:35,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:36,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:36,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954755899] [2025-04-13 19:02:36,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954755899] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:36,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:36,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:36,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474422590] [2025-04-13 19:02:36,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:36,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:36,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:36,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:36,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:36,467 INFO L87 Difference]: Start difference. First operand 10246 states and 39288 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:37,490 INFO L93 Difference]: Finished difference Result 19694 states and 72557 transitions. [2025-04-13 19:02:37,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:02:37,491 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:37,491 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:37,554 INFO L225 Difference]: With dead ends: 19694 [2025-04-13 19:02:37,554 INFO L226 Difference]: Without dead ends: 19611 [2025-04-13 19:02:37,560 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:02:37,560 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 312 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:37,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 600 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:02:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19611 states. [2025-04-13 19:02:37,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19611 to 10231. [2025-04-13 19:02:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10231 states, 10230 states have (on average 3.836559139784946) internal successors, (39248), 10230 states have internal predecessors, (39248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10231 states to 10231 states and 39248 transitions. [2025-04-13 19:02:37,793 INFO L79 Accepts]: Start accepts. Automaton has 10231 states and 39248 transitions. Word has length 54 [2025-04-13 19:02:37,794 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:37,794 INFO L485 AbstractCegarLoop]: Abstraction has 10231 states and 39248 transitions. [2025-04-13 19:02:37,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:37,794 INFO L278 IsEmpty]: Start isEmpty. Operand 10231 states and 39248 transitions. [2025-04-13 19:02:37,809 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:37,809 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:37,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:37,809 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385 [2025-04-13 19:02:37,809 INFO L403 AbstractCegarLoop]: === Iteration 387 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:37,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:37,809 INFO L85 PathProgramCache]: Analyzing trace with hash -338065122, now seen corresponding path program 387 times [2025-04-13 19:02:37,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:37,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838423489] [2025-04-13 19:02:37,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:02:37,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:37,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:37,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:37,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:02:37,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:38,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:38,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838423489] [2025-04-13 19:02:38,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838423489] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:38,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:38,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:38,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696093087] [2025-04-13 19:02:38,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:38,393 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:38,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:38,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:38,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:38,394 INFO L87 Difference]: Start difference. First operand 10231 states and 39248 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:39,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:39,314 INFO L93 Difference]: Finished difference Result 18696 states and 69256 transitions. [2025-04-13 19:02:39,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 19:02:39,314 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:39,314 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:39,375 INFO L225 Difference]: With dead ends: 18696 [2025-04-13 19:02:39,375 INFO L226 Difference]: Without dead ends: 18632 [2025-04-13 19:02:39,380 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2025-04-13 19:02:39,381 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 283 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:39,381 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 581 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:39,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18632 states. [2025-04-13 19:02:39,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18632 to 10255. [2025-04-13 19:02:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10255 states, 10254 states have (on average 3.8349912229373904) internal successors, (39324), 10254 states have internal predecessors, (39324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:39,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10255 states to 10255 states and 39324 transitions. [2025-04-13 19:02:39,601 INFO L79 Accepts]: Start accepts. Automaton has 10255 states and 39324 transitions. Word has length 54 [2025-04-13 19:02:39,602 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:39,602 INFO L485 AbstractCegarLoop]: Abstraction has 10255 states and 39324 transitions. [2025-04-13 19:02:39,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:39,602 INFO L278 IsEmpty]: Start isEmpty. Operand 10255 states and 39324 transitions. [2025-04-13 19:02:39,617 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:39,617 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:39,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:39,617 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable386 [2025-04-13 19:02:39,617 INFO L403 AbstractCegarLoop]: === Iteration 388 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:39,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:39,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1852471154, now seen corresponding path program 388 times [2025-04-13 19:02:39,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:39,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610736880] [2025-04-13 19:02:39,617 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:02:39,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:39,620 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:02:39,631 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:39,631 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:02:39,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:40,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:40,156 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610736880] [2025-04-13 19:02:40,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610736880] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:40,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:40,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:40,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525506705] [2025-04-13 19:02:40,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:40,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:40,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:40,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:40,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:40,157 INFO L87 Difference]: Start difference. First operand 10255 states and 39324 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:41,152 INFO L93 Difference]: Finished difference Result 19789 states and 72875 transitions. [2025-04-13 19:02:41,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 19:02:41,153 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:41,153 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:41,217 INFO L225 Difference]: With dead ends: 19789 [2025-04-13 19:02:41,217 INFO L226 Difference]: Without dead ends: 19719 [2025-04-13 19:02:41,224 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=479, Unknown=0, NotChecked=0, Total=702 [2025-04-13 19:02:41,224 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 340 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:41,224 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 530 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:41,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19719 states. [2025-04-13 19:02:41,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19719 to 10288. [2025-04-13 19:02:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10288 states, 10287 states have (on average 3.8327014678720714) internal successors, (39427), 10287 states have internal predecessors, (39427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10288 states to 10288 states and 39427 transitions. [2025-04-13 19:02:41,457 INFO L79 Accepts]: Start accepts. Automaton has 10288 states and 39427 transitions. Word has length 54 [2025-04-13 19:02:41,457 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:41,457 INFO L485 AbstractCegarLoop]: Abstraction has 10288 states and 39427 transitions. [2025-04-13 19:02:41,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:41,457 INFO L278 IsEmpty]: Start isEmpty. Operand 10288 states and 39427 transitions. [2025-04-13 19:02:41,473 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:41,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:41,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:41,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable387 [2025-04-13 19:02:41,473 INFO L403 AbstractCegarLoop]: === Iteration 389 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:41,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:41,473 INFO L85 PathProgramCache]: Analyzing trace with hash 507649406, now seen corresponding path program 389 times [2025-04-13 19:02:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:41,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541984608] [2025-04-13 19:02:41,474 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:02:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:41,476 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:41,486 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:41,486 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:02:41,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:42,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:42,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541984608] [2025-04-13 19:02:42,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541984608] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:42,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:42,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:42,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66751375] [2025-04-13 19:02:42,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:42,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:42,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:42,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:42,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:42,037 INFO L87 Difference]: Start difference. First operand 10288 states and 39427 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:42,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:42,981 INFO L93 Difference]: Finished difference Result 18685 states and 69219 transitions. [2025-04-13 19:02:42,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:02:42,982 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:42,982 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:43,044 INFO L225 Difference]: With dead ends: 18685 [2025-04-13 19:02:43,044 INFO L226 Difference]: Without dead ends: 18609 [2025-04-13 19:02:43,050 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=441, Unknown=0, NotChecked=0, Total=650 [2025-04-13 19:02:43,050 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 295 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:43,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 597 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:43,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18609 states. [2025-04-13 19:02:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18609 to 10280. [2025-04-13 19:02:43,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10280 states, 10279 states have (on average 3.832960404708629) internal successors, (39399), 10279 states have internal predecessors, (39399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10280 states to 10280 states and 39399 transitions. [2025-04-13 19:02:43,337 INFO L79 Accepts]: Start accepts. Automaton has 10280 states and 39399 transitions. Word has length 54 [2025-04-13 19:02:43,337 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:43,337 INFO L485 AbstractCegarLoop]: Abstraction has 10280 states and 39399 transitions. [2025-04-13 19:02:43,337 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:43,337 INFO L278 IsEmpty]: Start isEmpty. Operand 10280 states and 39399 transitions. [2025-04-13 19:02:43,353 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:43,353 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:43,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:43,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable388 [2025-04-13 19:02:43,354 INFO L403 AbstractCegarLoop]: === Iteration 390 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:43,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:43,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2145047748, now seen corresponding path program 390 times [2025-04-13 19:02:43,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:43,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986240949] [2025-04-13 19:02:43,354 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:02:43,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:43,357 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:43,367 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:43,367 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:02:43,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:44,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:44,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986240949] [2025-04-13 19:02:44,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986240949] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:44,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:44,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:44,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196561283] [2025-04-13 19:02:44,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:44,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:44,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:44,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:44,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:44,002 INFO L87 Difference]: Start difference. First operand 10280 states and 39399 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:45,059 INFO L93 Difference]: Finished difference Result 19716 states and 72643 transitions. [2025-04-13 19:02:45,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:02:45,060 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:45,060 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:45,126 INFO L225 Difference]: With dead ends: 19716 [2025-04-13 19:02:45,126 INFO L226 Difference]: Without dead ends: 19634 [2025-04-13 19:02:45,132 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2025-04-13 19:02:45,132 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 303 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:45,132 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 613 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1650 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:02:45,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19634 states. [2025-04-13 19:02:45,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19634 to 10269. [2025-04-13 19:02:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10269 states, 10268 states have (on average 3.833365796649786) internal successors, (39361), 10268 states have internal predecessors, (39361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10269 states to 10269 states and 39361 transitions. [2025-04-13 19:02:45,363 INFO L79 Accepts]: Start accepts. Automaton has 10269 states and 39361 transitions. Word has length 54 [2025-04-13 19:02:45,363 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:45,363 INFO L485 AbstractCegarLoop]: Abstraction has 10269 states and 39361 transitions. [2025-04-13 19:02:45,363 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:45,363 INFO L278 IsEmpty]: Start isEmpty. Operand 10269 states and 39361 transitions. [2025-04-13 19:02:45,378 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:45,378 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:45,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:45,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable389 [2025-04-13 19:02:45,378 INFO L403 AbstractCegarLoop]: === Iteration 391 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:45,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:45,378 INFO L85 PathProgramCache]: Analyzing trace with hash -922113008, now seen corresponding path program 391 times [2025-04-13 19:02:45,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:45,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994510240] [2025-04-13 19:02:45,378 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:02:45,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:45,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:45,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:45,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:02:45,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:45,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:45,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994510240] [2025-04-13 19:02:45,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994510240] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:45,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:45,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:45,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58900004] [2025-04-13 19:02:45,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:45,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:45,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:45,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:45,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:45,991 INFO L87 Difference]: Start difference. First operand 10269 states and 39361 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:46,921 INFO L93 Difference]: Finished difference Result 18638 states and 69100 transitions. [2025-04-13 19:02:46,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:02:46,921 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:46,921 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:46,983 INFO L225 Difference]: With dead ends: 18638 [2025-04-13 19:02:46,983 INFO L226 Difference]: Without dead ends: 18514 [2025-04-13 19:02:46,989 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2025-04-13 19:02:46,989 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 271 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:46,989 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 532 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18514 states. [2025-04-13 19:02:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18514 to 10253. [2025-04-13 19:02:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10253 states, 10252 states have (on average 3.8338860710105345) internal successors, (39305), 10252 states have internal predecessors, (39305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10253 states to 10253 states and 39305 transitions. [2025-04-13 19:02:47,217 INFO L79 Accepts]: Start accepts. Automaton has 10253 states and 39305 transitions. Word has length 54 [2025-04-13 19:02:47,217 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:47,217 INFO L485 AbstractCegarLoop]: Abstraction has 10253 states and 39305 transitions. [2025-04-13 19:02:47,217 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:47,217 INFO L278 IsEmpty]: Start isEmpty. Operand 10253 states and 39305 transitions. [2025-04-13 19:02:47,232 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:47,232 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:47,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:47,232 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable390 [2025-04-13 19:02:47,232 INFO L403 AbstractCegarLoop]: === Iteration 392 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:47,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:47,233 INFO L85 PathProgramCache]: Analyzing trace with hash -274101282, now seen corresponding path program 392 times [2025-04-13 19:02:47,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:47,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817907613] [2025-04-13 19:02:47,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:02:47,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:47,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:47,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:47,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:02:47,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:47,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:47,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817907613] [2025-04-13 19:02:47,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817907613] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:47,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:47,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:47,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668684092] [2025-04-13 19:02:47,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:47,911 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:47,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:47,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:47,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:47,911 INFO L87 Difference]: Start difference. First operand 10253 states and 39305 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:48,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:48,918 INFO L93 Difference]: Finished difference Result 19664 states and 72503 transitions. [2025-04-13 19:02:48,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:02:48,919 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:48,919 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:48,982 INFO L225 Difference]: With dead ends: 19664 [2025-04-13 19:02:48,982 INFO L226 Difference]: Without dead ends: 19525 [2025-04-13 19:02:48,988 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2025-04-13 19:02:48,988 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 293 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:48,989 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 567 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:02:49,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19525 states. [2025-04-13 19:02:49,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19525 to 10231. [2025-04-13 19:02:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10231 states, 10230 states have (on average 3.8347996089931575) internal successors, (39230), 10230 states have internal predecessors, (39230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10231 states to 10231 states and 39230 transitions. [2025-04-13 19:02:49,217 INFO L79 Accepts]: Start accepts. Automaton has 10231 states and 39230 transitions. Word has length 54 [2025-04-13 19:02:49,218 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:49,218 INFO L485 AbstractCegarLoop]: Abstraction has 10231 states and 39230 transitions. [2025-04-13 19:02:49,218 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:49,218 INFO L278 IsEmpty]: Start isEmpty. Operand 10231 states and 39230 transitions. [2025-04-13 19:02:49,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:49,233 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:49,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] [2025-04-13 19:02:49,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable391 [2025-04-13 19:02:49,233 INFO L403 AbstractCegarLoop]: === Iteration 393 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:49,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:49,233 INFO L85 PathProgramCache]: Analyzing trace with hash -110584242, now seen corresponding path program 393 times [2025-04-13 19:02:49,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:49,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510116773] [2025-04-13 19:02:49,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:02:49,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:49,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:49,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:49,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:02:49,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:49,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:49,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510116773] [2025-04-13 19:02:49,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510116773] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:49,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:49,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:49,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779041402] [2025-04-13 19:02:49,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:49,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:49,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:49,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:49,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:49,827 INFO L87 Difference]: Start difference. First operand 10231 states and 39230 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:50,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:50,715 INFO L93 Difference]: Finished difference Result 18544 states and 68770 transitions. [2025-04-13 19:02:50,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:02:50,715 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:50,716 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:50,777 INFO L225 Difference]: With dead ends: 18544 [2025-04-13 19:02:50,777 INFO L226 Difference]: Without dead ends: 18476 [2025-04-13 19:02:50,783 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:02:50,783 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 282 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:50,783 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 520 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:50,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18476 states. [2025-04-13 19:02:50,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18476 to 10261. [2025-04-13 19:02:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10261 states, 10260 states have (on average 3.8328460038986356) internal successors, (39325), 10260 states have internal predecessors, (39325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10261 states to 10261 states and 39325 transitions. [2025-04-13 19:02:51,009 INFO L79 Accepts]: Start accepts. Automaton has 10261 states and 39325 transitions. Word has length 54 [2025-04-13 19:02:51,009 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:51,009 INFO L485 AbstractCegarLoop]: Abstraction has 10261 states and 39325 transitions. [2025-04-13 19:02:51,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:51,009 INFO L278 IsEmpty]: Start isEmpty. Operand 10261 states and 39325 transitions. [2025-04-13 19:02:51,024 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:51,024 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:51,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:51,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable392 [2025-04-13 19:02:51,025 INFO L403 AbstractCegarLoop]: === Iteration 394 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:51,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:51,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1127017284, now seen corresponding path program 394 times [2025-04-13 19:02:51,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:51,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073527244] [2025-04-13 19:02:51,025 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:02:51,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:51,027 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:02:51,039 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:51,039 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:02:51,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:51,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:51,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073527244] [2025-04-13 19:02:51,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073527244] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:51,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:51,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:51,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419365090] [2025-04-13 19:02:51,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:51,546 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:51,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:51,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:51,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:51,546 INFO L87 Difference]: Start difference. First operand 10261 states and 39325 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:52,500 INFO L93 Difference]: Finished difference Result 19586 states and 72242 transitions. [2025-04-13 19:02:52,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:02:52,500 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:52,500 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:52,564 INFO L225 Difference]: With dead ends: 19586 [2025-04-13 19:02:52,564 INFO L226 Difference]: Without dead ends: 19515 [2025-04-13 19:02:52,567 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:02:52,567 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 326 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:52,567 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 537 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:52,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19515 states. [2025-04-13 19:02:52,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19515 to 10291. [2025-04-13 19:02:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10291 states, 10290 states have (on average 3.8309037900874636) internal successors, (39420), 10290 states have internal predecessors, (39420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10291 states to 10291 states and 39420 transitions. [2025-04-13 19:02:52,781 INFO L79 Accepts]: Start accepts. Automaton has 10291 states and 39420 transitions. Word has length 54 [2025-04-13 19:02:52,781 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:52,781 INFO L485 AbstractCegarLoop]: Abstraction has 10291 states and 39420 transitions. [2025-04-13 19:02:52,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:52,782 INFO L278 IsEmpty]: Start isEmpty. Operand 10291 states and 39420 transitions. [2025-04-13 19:02:52,796 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:52,796 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:52,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:52,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable393 [2025-04-13 19:02:52,797 INFO L403 AbstractCegarLoop]: === Iteration 395 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:52,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:52,797 INFO L85 PathProgramCache]: Analyzing trace with hash -115835794, now seen corresponding path program 395 times [2025-04-13 19:02:52,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:52,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507153119] [2025-04-13 19:02:52,797 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:02:52,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:52,799 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:52,811 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:52,811 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:02:52,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:53,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:53,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507153119] [2025-04-13 19:02:53,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507153119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:53,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:53,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:53,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387541442] [2025-04-13 19:02:53,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:53,377 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:53,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:53,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:53,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:53,378 INFO L87 Difference]: Start difference. First operand 10291 states and 39420 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:54,234 INFO L93 Difference]: Finished difference Result 18506 states and 68682 transitions. [2025-04-13 19:02:54,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:02:54,234 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:54,234 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:54,297 INFO L225 Difference]: With dead ends: 18506 [2025-04-13 19:02:54,297 INFO L226 Difference]: Without dead ends: 18425 [2025-04-13 19:02:54,302 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:02:54,302 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 285 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:54,302 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 545 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18425 states. [2025-04-13 19:02:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18425 to 10281. [2025-04-13 19:02:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10281 states, 10280 states have (on average 3.8312256809338523) internal successors, (39385), 10280 states have internal predecessors, (39385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:54,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10281 states to 10281 states and 39385 transitions. [2025-04-13 19:02:54,613 INFO L79 Accepts]: Start accepts. Automaton has 10281 states and 39385 transitions. Word has length 54 [2025-04-13 19:02:54,613 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:54,613 INFO L485 AbstractCegarLoop]: Abstraction has 10281 states and 39385 transitions. [2025-04-13 19:02:54,613 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:54,613 INFO L278 IsEmpty]: Start isEmpty. Operand 10281 states and 39385 transitions. [2025-04-13 19:02:54,629 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:54,630 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:54,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:54,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable394 [2025-04-13 19:02:54,630 INFO L403 AbstractCegarLoop]: === Iteration 396 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:54,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2096679204, now seen corresponding path program 396 times [2025-04-13 19:02:54,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:54,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258461982] [2025-04-13 19:02:54,630 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:02:54,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:54,633 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:54,643 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:54,643 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:02:54,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:55,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:55,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258461982] [2025-04-13 19:02:55,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258461982] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:55,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:55,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:55,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596964757] [2025-04-13 19:02:55,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:55,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:55,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:55,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:55,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:55,216 INFO L87 Difference]: Start difference. First operand 10281 states and 39385 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:56,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:56,210 INFO L93 Difference]: Finished difference Result 19505 states and 72017 transitions. [2025-04-13 19:02:56,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:02:56,210 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:56,210 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:56,275 INFO L225 Difference]: With dead ends: 19505 [2025-04-13 19:02:56,275 INFO L226 Difference]: Without dead ends: 19427 [2025-04-13 19:02:56,281 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:02:56,281 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 300 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:56,281 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 519 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:56,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19427 states. [2025-04-13 19:02:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19427 to 10271. [2025-04-13 19:02:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10271 states, 10270 states have (on average 3.8315481986368063) internal successors, (39350), 10270 states have internal predecessors, (39350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10271 states to 10271 states and 39350 transitions. [2025-04-13 19:02:56,533 INFO L79 Accepts]: Start accepts. Automaton has 10271 states and 39350 transitions. Word has length 54 [2025-04-13 19:02:56,533 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:56,533 INFO L485 AbstractCegarLoop]: Abstraction has 10271 states and 39350 transitions. [2025-04-13 19:02:56,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:56,533 INFO L278 IsEmpty]: Start isEmpty. Operand 10271 states and 39350 transitions. [2025-04-13 19:02:56,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:56,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:56,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] [2025-04-13 19:02:56,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable395 [2025-04-13 19:02:56,549 INFO L403 AbstractCegarLoop]: === Iteration 397 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:56,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:56,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1548223984, now seen corresponding path program 397 times [2025-04-13 19:02:56,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:56,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604934685] [2025-04-13 19:02:56,550 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:02:56,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:56,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:56,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:56,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:02:56,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:57,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:57,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604934685] [2025-04-13 19:02:57,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604934685] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:57,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:57,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:57,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443128031] [2025-04-13 19:02:57,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:57,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:57,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:57,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:57,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:57,232 INFO L87 Difference]: Start difference. First operand 10271 states and 39350 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:58,186 INFO L93 Difference]: Finished difference Result 18415 states and 68432 transitions. [2025-04-13 19:02:58,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:02:58,187 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:58,187 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:58,247 INFO L225 Difference]: With dead ends: 18415 [2025-04-13 19:02:58,248 INFO L226 Difference]: Without dead ends: 18223 [2025-04-13 19:02:58,253 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:02:58,253 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 274 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:58,253 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 489 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:02:58,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18223 states. [2025-04-13 19:02:58,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18223 to 10187. [2025-04-13 19:02:58,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10187 states, 10186 states have (on average 3.8403691341056354) internal successors, (39118), 10186 states have internal predecessors, (39118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10187 states to 10187 states and 39118 transitions. [2025-04-13 19:02:58,473 INFO L79 Accepts]: Start accepts. Automaton has 10187 states and 39118 transitions. Word has length 54 [2025-04-13 19:02:58,473 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:58,474 INFO L485 AbstractCegarLoop]: Abstraction has 10187 states and 39118 transitions. [2025-04-13 19:02:58,474 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:58,474 INFO L278 IsEmpty]: Start isEmpty. Operand 10187 states and 39118 transitions. [2025-04-13 19:02:58,488 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:02:58,489 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:58,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:58,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable396 [2025-04-13 19:02:58,489 INFO L403 AbstractCegarLoop]: === Iteration 398 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:02:58,489 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash 478672122, now seen corresponding path program 398 times [2025-04-13 19:02:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:58,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994385261] [2025-04-13 19:02:58,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:02:58,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:58,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:02:58,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:02:58,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:02:58,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:59,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:59,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994385261] [2025-04-13 19:02:59,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994385261] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:59,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:02:59,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:02:59,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377792179] [2025-04-13 19:02:59,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:59,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:02:59,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:59,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:02:59,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:02:59,083 INFO L87 Difference]: Start difference. First operand 10187 states and 39118 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:59,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:59,967 INFO L93 Difference]: Finished difference Result 19343 states and 71577 transitions. [2025-04-13 19:02:59,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:02:59,967 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:02:59,968 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:00,036 INFO L225 Difference]: With dead ends: 19343 [2025-04-13 19:03:00,036 INFO L226 Difference]: Without dead ends: 19118 [2025-04-13 19:03:00,042 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:03:00,042 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 281 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:00,042 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 515 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:03:00,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19118 states. [2025-04-13 19:03:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19118 to 10079. [2025-04-13 19:03:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10079 states, 10078 states have (on average 3.8525501091486407) internal successors, (38826), 10078 states have internal predecessors, (38826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:00,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10079 states to 10079 states and 38826 transitions. [2025-04-13 19:03:00,272 INFO L79 Accepts]: Start accepts. Automaton has 10079 states and 38826 transitions. Word has length 54 [2025-04-13 19:03:00,272 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:00,272 INFO L485 AbstractCegarLoop]: Abstraction has 10079 states and 38826 transitions. [2025-04-13 19:03:00,272 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:00,272 INFO L278 IsEmpty]: Start isEmpty. Operand 10079 states and 38826 transitions. [2025-04-13 19:03:00,287 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:00,287 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:00,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] [2025-04-13 19:03:00,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable397 [2025-04-13 19:03:00,287 INFO L403 AbstractCegarLoop]: === Iteration 399 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:00,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash -689445568, now seen corresponding path program 399 times [2025-04-13 19:03:00,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:00,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53485039] [2025-04-13 19:03:00,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:03:00,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:00,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:03:00,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:00,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:03:00,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:00,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:00,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53485039] [2025-04-13 19:03:00,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53485039] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:00,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:00,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:00,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343332142] [2025-04-13 19:03:00,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:00,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:00,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:00,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:00,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:00,927 INFO L87 Difference]: Start difference. First operand 10079 states and 38826 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:01,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:01,870 INFO L93 Difference]: Finished difference Result 19258 states and 71203 transitions. [2025-04-13 19:03:01,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:01,870 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:01,870 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:01,932 INFO L225 Difference]: With dead ends: 19258 [2025-04-13 19:03:01,932 INFO L226 Difference]: Without dead ends: 19194 [2025-04-13 19:03:01,938 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:01,938 INFO L437 NwaCegarLoop]: 102 mSDtfsCounter, 330 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:01,938 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 580 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:03:01,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19194 states. [2025-04-13 19:03:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19194 to 10145. [2025-04-13 19:03:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10145 states, 10144 states have (on average 3.8520307570977916) internal successors, (39075), 10144 states have internal predecessors, (39075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10145 states to 10145 states and 39075 transitions. [2025-04-13 19:03:02,170 INFO L79 Accepts]: Start accepts. Automaton has 10145 states and 39075 transitions. Word has length 54 [2025-04-13 19:03:02,171 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:02,171 INFO L485 AbstractCegarLoop]: Abstraction has 10145 states and 39075 transitions. [2025-04-13 19:03:02,171 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:02,171 INFO L278 IsEmpty]: Start isEmpty. Operand 10145 states and 39075 transitions. [2025-04-13 19:03:02,186 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:02,186 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:02,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] [2025-04-13 19:03:02,186 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable398 [2025-04-13 19:03:02,186 INFO L403 AbstractCegarLoop]: === Iteration 400 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:02,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:02,186 INFO L85 PathProgramCache]: Analyzing trace with hash -211710316, now seen corresponding path program 400 times [2025-04-13 19:03:02,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:02,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594083006] [2025-04-13 19:03:02,187 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:03:02,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:02,189 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:03:02,199 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:02,199 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:03:02,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:02,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:02,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:02,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594083006] [2025-04-13 19:03:02,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594083006] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:02,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:02,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:02,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70228385] [2025-04-13 19:03:02,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:02,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:02,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:02,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:02,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:02,844 INFO L87 Difference]: Start difference. First operand 10145 states and 39075 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:03,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:03,787 INFO L93 Difference]: Finished difference Result 20408 states and 75061 transitions. [2025-04-13 19:03:03,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:03,788 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:03,788 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:03,853 INFO L225 Difference]: With dead ends: 20408 [2025-04-13 19:03:03,853 INFO L226 Difference]: Without dead ends: 20338 [2025-04-13 19:03:03,860 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:03,861 INFO L437 NwaCegarLoop]: 102 mSDtfsCounter, 322 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:03,861 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 616 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1692 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:03:03,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20338 states. [2025-04-13 19:03:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20338 to 10211. [2025-04-13 19:03:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10211 states, 10210 states have (on average 3.8515181194906956) internal successors, (39324), 10210 states have internal predecessors, (39324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10211 states to 10211 states and 39324 transitions. [2025-04-13 19:03:04,091 INFO L79 Accepts]: Start accepts. Automaton has 10211 states and 39324 transitions. Word has length 54 [2025-04-13 19:03:04,091 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:04,091 INFO L485 AbstractCegarLoop]: Abstraction has 10211 states and 39324 transitions. [2025-04-13 19:03:04,091 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:04,091 INFO L278 IsEmpty]: Start isEmpty. Operand 10211 states and 39324 transitions. [2025-04-13 19:03:04,106 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:04,106 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:04,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:04,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable399 [2025-04-13 19:03:04,106 INFO L403 AbstractCegarLoop]: === Iteration 401 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:04,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash 280216352, now seen corresponding path program 401 times [2025-04-13 19:03:04,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:04,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88426962] [2025-04-13 19:03:04,106 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:03:04,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:04,109 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:03:04,119 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:04,119 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:03:04,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:04,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 19:03:04,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:04,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88426962] [2025-04-13 19:03:04,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88426962] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:04,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:04,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:04,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631423642] [2025-04-13 19:03:04,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:04,651 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:04,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:04,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:04,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:04,651 INFO L87 Difference]: Start difference. First operand 10211 states and 39324 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:05,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:05,530 INFO L93 Difference]: Finished difference Result 19260 states and 71283 transitions. [2025-04-13 19:03:05,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:05,530 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:05,530 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:05,596 INFO L225 Difference]: With dead ends: 19260 [2025-04-13 19:03:05,596 INFO L226 Difference]: Without dead ends: 19182 [2025-04-13 19:03:05,602 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:05,602 INFO L437 NwaCegarLoop]: 102 mSDtfsCounter, 321 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:05,602 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 518 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:03:05,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19182 states. [2025-04-13 19:03:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19182 to 10203. [2025-04-13 19:03:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10203 states, 10202 states have (on average 3.8517937659282495) internal successors, (39296), 10202 states have internal predecessors, (39296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:05,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 39296 transitions. [2025-04-13 19:03:05,904 INFO L79 Accepts]: Start accepts. Automaton has 10203 states and 39296 transitions. Word has length 54 [2025-04-13 19:03:05,904 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:05,904 INFO L485 AbstractCegarLoop]: Abstraction has 10203 states and 39296 transitions. [2025-04-13 19:03:05,904 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:05,904 INFO L278 IsEmpty]: Start isEmpty. Operand 10203 states and 39296 transitions. [2025-04-13 19:03:05,919 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:05,919 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:05,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] [2025-04-13 19:03:05,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable400 [2025-04-13 19:03:05,919 INFO L403 AbstractCegarLoop]: === Iteration 402 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:05,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:05,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1181372236, now seen corresponding path program 402 times [2025-04-13 19:03:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:05,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055872591] [2025-04-13 19:03:05,920 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:03:05,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:05,922 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:03:05,931 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:05,931 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:03:05,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:06,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:06,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055872591] [2025-04-13 19:03:06,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055872591] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:06,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:06,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:06,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139630695] [2025-04-13 19:03:06,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:06,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:06,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:06,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:06,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:06,506 INFO L87 Difference]: Start difference. First operand 10203 states and 39296 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:07,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:07,474 INFO L93 Difference]: Finished difference Result 20330 states and 74847 transitions. [2025-04-13 19:03:07,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:07,474 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:07,474 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:07,542 INFO L225 Difference]: With dead ends: 20330 [2025-04-13 19:03:07,542 INFO L226 Difference]: Without dead ends: 20258 [2025-04-13 19:03:07,548 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:07,548 INFO L437 NwaCegarLoop]: 102 mSDtfsCounter, 326 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:07,548 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 604 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:03:07,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20258 states. [2025-04-13 19:03:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20258 to 10195. [2025-04-13 19:03:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10195 states, 10194 states have (on average 3.852069845006867) internal successors, (39268), 10194 states have internal predecessors, (39268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10195 states to 10195 states and 39268 transitions. [2025-04-13 19:03:07,787 INFO L79 Accepts]: Start accepts. Automaton has 10195 states and 39268 transitions. Word has length 54 [2025-04-13 19:03:07,787 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:07,787 INFO L485 AbstractCegarLoop]: Abstraction has 10195 states and 39268 transitions. [2025-04-13 19:03:07,787 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:07,787 INFO L278 IsEmpty]: Start isEmpty. Operand 10195 states and 39268 transitions. [2025-04-13 19:03:07,802 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:07,802 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:07,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:07,803 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401 [2025-04-13 19:03:07,803 INFO L403 AbstractCegarLoop]: === Iteration 403 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:07,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:07,803 INFO L85 PathProgramCache]: Analyzing trace with hash 926746942, now seen corresponding path program 403 times [2025-04-13 19:03:07,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:07,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033466198] [2025-04-13 19:03:07,803 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:03:07,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:07,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:03:07,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:07,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:03:07,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:08,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:08,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033466198] [2025-04-13 19:03:08,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033466198] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:08,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:08,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:08,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672165374] [2025-04-13 19:03:08,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:08,429 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:08,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:08,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:08,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:08,429 INFO L87 Difference]: Start difference. First operand 10195 states and 39268 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:09,430 INFO L93 Difference]: Finished difference Result 19286 states and 71354 transitions. [2025-04-13 19:03:09,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:09,430 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:09,431 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:09,496 INFO L225 Difference]: With dead ends: 19286 [2025-04-13 19:03:09,496 INFO L226 Difference]: Without dead ends: 19150 [2025-04-13 19:03:09,502 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:09,502 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 314 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:09,502 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 581 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:03:09,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19150 states. [2025-04-13 19:03:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19150 to 10171. [2025-04-13 19:03:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10171 states, 10170 states have (on average 3.8525073746312684) internal successors, (39180), 10170 states have internal predecessors, (39180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10171 states to 10171 states and 39180 transitions. [2025-04-13 19:03:09,737 INFO L79 Accepts]: Start accepts. Automaton has 10171 states and 39180 transitions. Word has length 54 [2025-04-13 19:03:09,737 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:09,737 INFO L485 AbstractCegarLoop]: Abstraction has 10171 states and 39180 transitions. [2025-04-13 19:03:09,737 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:09,737 INFO L278 IsEmpty]: Start isEmpty. Operand 10171 states and 39180 transitions. [2025-04-13 19:03:09,752 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:09,752 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:09,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:09,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable402 [2025-04-13 19:03:09,752 INFO L403 AbstractCegarLoop]: === Iteration 404 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:09,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1393979090, now seen corresponding path program 404 times [2025-04-13 19:03:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:09,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388727917] [2025-04-13 19:03:09,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:03:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:09,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:03:09,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:09,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:03:09,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:10,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:10,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388727917] [2025-04-13 19:03:10,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388727917] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:10,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:10,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:10,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384409162] [2025-04-13 19:03:10,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:10,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:10,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:10,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:10,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:10,382 INFO L87 Difference]: Start difference. First operand 10171 states and 39180 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:11,378 INFO L93 Difference]: Finished difference Result 20370 states and 74943 transitions. [2025-04-13 19:03:11,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:11,378 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:11,378 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:11,451 INFO L225 Difference]: With dead ends: 20370 [2025-04-13 19:03:11,451 INFO L226 Difference]: Without dead ends: 20210 [2025-04-13 19:03:11,457 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:11,457 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 314 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:11,457 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 568 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:03:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20210 states. [2025-04-13 19:03:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20210 to 10147. [2025-04-13 19:03:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10147 states, 10146 states have (on average 3.8529469741770157) internal successors, (39092), 10146 states have internal predecessors, (39092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:11,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10147 states to 10147 states and 39092 transitions. [2025-04-13 19:03:11,701 INFO L79 Accepts]: Start accepts. Automaton has 10147 states and 39092 transitions. Word has length 54 [2025-04-13 19:03:11,701 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:11,701 INFO L485 AbstractCegarLoop]: Abstraction has 10147 states and 39092 transitions. [2025-04-13 19:03:11,701 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:11,701 INFO L278 IsEmpty]: Start isEmpty. Operand 10147 states and 39092 transitions. [2025-04-13 19:03:11,716 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:11,716 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:11,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:11,716 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable403 [2025-04-13 19:03:11,716 INFO L403 AbstractCegarLoop]: === Iteration 405 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:11,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:11,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1112700354, now seen corresponding path program 405 times [2025-04-13 19:03:11,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:11,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031332139] [2025-04-13 19:03:11,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:03:11,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:11,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:03:11,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:11,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:03:11,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:12,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:12,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031332139] [2025-04-13 19:03:12,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031332139] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:12,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:12,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:12,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379635744] [2025-04-13 19:03:12,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:12,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:12,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:12,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:12,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:12,338 INFO L87 Difference]: Start difference. First operand 10147 states and 39092 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:13,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:13,254 INFO L93 Difference]: Finished difference Result 19262 states and 71235 transitions. [2025-04-13 19:03:13,255 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:13,255 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:13,255 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:13,322 INFO L225 Difference]: With dead ends: 19262 [2025-04-13 19:03:13,323 INFO L226 Difference]: Without dead ends: 19198 [2025-04-13 19:03:13,329 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:13,329 INFO L437 NwaCegarLoop]: 100 mSDtfsCounter, 360 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:13,329 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 560 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:03:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19198 states. [2025-04-13 19:03:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19198 to 10159. [2025-04-13 19:03:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10159 states, 10158 states have (on average 3.8519393581413666) internal successors, (39128), 10158 states have internal predecessors, (39128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10159 states to 10159 states and 39128 transitions. [2025-04-13 19:03:13,564 INFO L79 Accepts]: Start accepts. Automaton has 10159 states and 39128 transitions. Word has length 54 [2025-04-13 19:03:13,565 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:13,565 INFO L485 AbstractCegarLoop]: Abstraction has 10159 states and 39128 transitions. [2025-04-13 19:03:13,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:13,565 INFO L278 IsEmpty]: Start isEmpty. Operand 10159 states and 39128 transitions. [2025-04-13 19:03:13,580 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:13,580 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:13,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:13,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable404 [2025-04-13 19:03:13,580 INFO L403 AbstractCegarLoop]: === Iteration 406 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:13,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:13,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1859047378, now seen corresponding path program 406 times [2025-04-13 19:03:13,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:13,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036358959] [2025-04-13 19:03:13,581 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:03:13,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:13,583 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:03:13,594 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:13,594 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:03:13,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:14,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:14,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036358959] [2025-04-13 19:03:14,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036358959] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:14,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:14,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:14,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035414278] [2025-04-13 19:03:14,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:14,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:14,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:14,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:14,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:14,227 INFO L87 Difference]: Start difference. First operand 10159 states and 39128 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:15,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:15,176 INFO L93 Difference]: Finished difference Result 20344 states and 74839 transitions. [2025-04-13 19:03:15,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:15,176 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:15,176 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:15,241 INFO L225 Difference]: With dead ends: 20344 [2025-04-13 19:03:15,241 INFO L226 Difference]: Without dead ends: 20274 [2025-04-13 19:03:15,248 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:15,248 INFO L437 NwaCegarLoop]: 100 mSDtfsCounter, 343 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:15,248 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 582 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:03:15,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20274 states. [2025-04-13 19:03:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20274 to 10171. [2025-04-13 19:03:15,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10171 states, 10170 states have (on average 3.8509341199606686) internal successors, (39164), 10170 states have internal predecessors, (39164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10171 states to 10171 states and 39164 transitions. [2025-04-13 19:03:15,482 INFO L79 Accepts]: Start accepts. Automaton has 10171 states and 39164 transitions. Word has length 54 [2025-04-13 19:03:15,482 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:15,482 INFO L485 AbstractCegarLoop]: Abstraction has 10171 states and 39164 transitions. [2025-04-13 19:03:15,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:15,482 INFO L278 IsEmpty]: Start isEmpty. Operand 10171 states and 39164 transitions. [2025-04-13 19:03:15,498 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:15,498 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:15,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:15,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable405 [2025-04-13 19:03:15,498 INFO L403 AbstractCegarLoop]: === Iteration 407 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:15,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:15,498 INFO L85 PathProgramCache]: Analyzing trace with hash -143038434, now seen corresponding path program 407 times [2025-04-13 19:03:15,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:15,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563849698] [2025-04-13 19:03:15,498 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:03:15,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:15,501 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:03:15,511 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:15,511 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:03:15,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:16,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:16,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563849698] [2025-04-13 19:03:16,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563849698] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:16,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:16,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:16,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052634816] [2025-04-13 19:03:16,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:16,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:16,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:16,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:16,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:16,130 INFO L87 Difference]: Start difference. First operand 10171 states and 39164 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:17,057 INFO L93 Difference]: Finished difference Result 19280 states and 71280 transitions. [2025-04-13 19:03:17,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:17,057 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:17,057 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:17,123 INFO L225 Difference]: With dead ends: 19280 [2025-04-13 19:03:17,123 INFO L226 Difference]: Without dead ends: 19202 [2025-04-13 19:03:17,128 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:17,129 INFO L437 NwaCegarLoop]: 100 mSDtfsCounter, 371 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:17,129 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 551 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:03:17,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19202 states. [2025-04-13 19:03:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19202 to 10163. [2025-04-13 19:03:17,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10163 states, 10162 states have (on average 3.8516040149576853) internal successors, (39140), 10162 states have internal predecessors, (39140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10163 states to 10163 states and 39140 transitions. [2025-04-13 19:03:17,400 INFO L79 Accepts]: Start accepts. Automaton has 10163 states and 39140 transitions. Word has length 54 [2025-04-13 19:03:17,400 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:17,400 INFO L485 AbstractCegarLoop]: Abstraction has 10163 states and 39140 transitions. [2025-04-13 19:03:17,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:17,400 INFO L278 IsEmpty]: Start isEmpty. Operand 10163 states and 39140 transitions. [2025-04-13 19:03:17,415 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:17,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:17,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:17,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable406 [2025-04-13 19:03:17,415 INFO L403 AbstractCegarLoop]: === Iteration 408 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:17,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:17,416 INFO L85 PathProgramCache]: Analyzing trace with hash 889385458, now seen corresponding path program 408 times [2025-04-13 19:03:17,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:17,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597790273] [2025-04-13 19:03:17,416 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:03:17,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:17,418 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:03:17,428 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:17,428 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:03:17,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:17,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:17,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597790273] [2025-04-13 19:03:17,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597790273] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:17,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:17,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:17,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721798195] [2025-04-13 19:03:17,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:17,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:17,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:17,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:17,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:17,998 INFO L87 Difference]: Start difference. First operand 10163 states and 39140 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:18,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:18,922 INFO L93 Difference]: Finished difference Result 20330 states and 74790 transitions. [2025-04-13 19:03:18,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:18,923 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:18,923 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:18,988 INFO L225 Difference]: With dead ends: 20330 [2025-04-13 19:03:18,988 INFO L226 Difference]: Without dead ends: 20258 [2025-04-13 19:03:18,994 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:18,994 INFO L437 NwaCegarLoop]: 100 mSDtfsCounter, 344 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:18,994 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 570 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:03:19,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20258 states. [2025-04-13 19:03:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20258 to 10155. [2025-04-13 19:03:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10155 states, 10154 states have (on average 3.8522749655308255) internal successors, (39116), 10154 states have internal predecessors, (39116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10155 states to 10155 states and 39116 transitions. [2025-04-13 19:03:19,225 INFO L79 Accepts]: Start accepts. Automaton has 10155 states and 39116 transitions. Word has length 54 [2025-04-13 19:03:19,225 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:19,225 INFO L485 AbstractCegarLoop]: Abstraction has 10155 states and 39116 transitions. [2025-04-13 19:03:19,225 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:19,225 INFO L278 IsEmpty]: Start isEmpty. Operand 10155 states and 39116 transitions. [2025-04-13 19:03:19,240 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:19,240 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:19,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:19,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable407 [2025-04-13 19:03:19,241 INFO L403 AbstractCegarLoop]: === Iteration 409 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:19,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:19,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1655350816, now seen corresponding path program 409 times [2025-04-13 19:03:19,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:19,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100197063] [2025-04-13 19:03:19,241 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:03:19,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:19,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:03:19,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:19,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:03:19,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:19,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:19,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100197063] [2025-04-13 19:03:19,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100197063] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:19,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:19,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:19,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611017328] [2025-04-13 19:03:19,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:19,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:19,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:19,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:19,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:19,862 INFO L87 Difference]: Start difference. First operand 10155 states and 39116 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:20,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:20,814 INFO L93 Difference]: Finished difference Result 19264 states and 71238 transitions. [2025-04-13 19:03:20,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:20,815 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:20,815 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:20,874 INFO L225 Difference]: With dead ends: 19264 [2025-04-13 19:03:20,874 INFO L226 Difference]: Without dead ends: 19200 [2025-04-13 19:03:20,879 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:20,879 INFO L437 NwaCegarLoop]: 100 mSDtfsCounter, 338 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:20,879 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 550 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:03:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19200 states. [2025-04-13 19:03:21,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19200 to 10163. [2025-04-13 19:03:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10163 states, 10162 states have (on average 3.851210391655186) internal successors, (39136), 10162 states have internal predecessors, (39136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10163 states to 10163 states and 39136 transitions. [2025-04-13 19:03:21,098 INFO L79 Accepts]: Start accepts. Automaton has 10163 states and 39136 transitions. Word has length 54 [2025-04-13 19:03:21,098 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:21,099 INFO L485 AbstractCegarLoop]: Abstraction has 10163 states and 39136 transitions. [2025-04-13 19:03:21,099 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:21,099 INFO L278 IsEmpty]: Start isEmpty. Operand 10163 states and 39136 transitions. [2025-04-13 19:03:21,114 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:21,114 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:21,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:21,114 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable408 [2025-04-13 19:03:21,114 INFO L403 AbstractCegarLoop]: === Iteration 410 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:21,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:21,115 INFO L85 PathProgramCache]: Analyzing trace with hash -3968076, now seen corresponding path program 410 times [2025-04-13 19:03:21,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:21,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675483545] [2025-04-13 19:03:21,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:03:21,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:21,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:03:21,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:21,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:03:21,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:21,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:21,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675483545] [2025-04-13 19:03:21,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675483545] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:21,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:21,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:21,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317337603] [2025-04-13 19:03:21,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:21,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:21,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:21,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:21,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:21,751 INFO L87 Difference]: Start difference. First operand 10163 states and 39136 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:22,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:22,678 INFO L93 Difference]: Finished difference Result 20354 states and 74860 transitions. [2025-04-13 19:03:22,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:22,678 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:22,678 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:22,740 INFO L225 Difference]: With dead ends: 20354 [2025-04-13 19:03:22,740 INFO L226 Difference]: Without dead ends: 20284 [2025-04-13 19:03:22,746 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:22,746 INFO L437 NwaCegarLoop]: 100 mSDtfsCounter, 345 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:22,746 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 564 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:03:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20284 states. [2025-04-13 19:03:22,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20284 to 10174. [2025-04-13 19:03:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10174 states, 10173 states have (on average 3.849700186768898) internal successors, (39163), 10173 states have internal predecessors, (39163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10174 states to 10174 states and 39163 transitions. [2025-04-13 19:03:22,975 INFO L79 Accepts]: Start accepts. Automaton has 10174 states and 39163 transitions. Word has length 54 [2025-04-13 19:03:22,975 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:22,975 INFO L485 AbstractCegarLoop]: Abstraction has 10174 states and 39163 transitions. [2025-04-13 19:03:22,975 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:22,975 INFO L278 IsEmpty]: Start isEmpty. Operand 10174 states and 39163 transitions. [2025-04-13 19:03:22,990 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:22,990 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:22,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:22,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable409 [2025-04-13 19:03:22,990 INFO L403 AbstractCegarLoop]: === Iteration 411 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:22,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:22,991 INFO L85 PathProgramCache]: Analyzing trace with hash -754630146, now seen corresponding path program 411 times [2025-04-13 19:03:22,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:22,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609886259] [2025-04-13 19:03:22,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:03:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:22,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:03:23,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:23,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:03:23,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:23,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:23,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609886259] [2025-04-13 19:03:23,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609886259] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:23,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:23,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:23,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224292277] [2025-04-13 19:03:23,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:23,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:23,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:23,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:23,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:23,591 INFO L87 Difference]: Start difference. First operand 10174 states and 39163 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:24,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:24,522 INFO L93 Difference]: Finished difference Result 19279 states and 71269 transitions. [2025-04-13 19:03:24,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:24,522 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:24,522 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:24,581 INFO L225 Difference]: With dead ends: 19279 [2025-04-13 19:03:24,581 INFO L226 Difference]: Without dead ends: 19203 [2025-04-13 19:03:24,586 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:24,586 INFO L437 NwaCegarLoop]: 100 mSDtfsCounter, 310 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:24,586 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 558 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:03:24,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19203 states. [2025-04-13 19:03:24,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19203 to 10166. [2025-04-13 19:03:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10166 states, 10165 states have (on average 3.850368912936547) internal successors, (39139), 10165 states have internal predecessors, (39139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10166 states to 10166 states and 39139 transitions. [2025-04-13 19:03:24,802 INFO L79 Accepts]: Start accepts. Automaton has 10166 states and 39139 transitions. Word has length 54 [2025-04-13 19:03:24,802 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:24,802 INFO L485 AbstractCegarLoop]: Abstraction has 10166 states and 39139 transitions. [2025-04-13 19:03:24,802 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:24,802 INFO L278 IsEmpty]: Start isEmpty. Operand 10166 states and 39139 transitions. [2025-04-13 19:03:24,817 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:24,817 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:24,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:24,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable410 [2025-04-13 19:03:24,817 INFO L403 AbstractCegarLoop]: === Iteration 412 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:24,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:24,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1881018258, now seen corresponding path program 412 times [2025-04-13 19:03:24,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:24,817 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222927615] [2025-04-13 19:03:24,817 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:03:24,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:24,820 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:03:24,830 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:24,830 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:03:24,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:25,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:25,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222927615] [2025-04-13 19:03:25,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222927615] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:25,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:25,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:25,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778598781] [2025-04-13 19:03:25,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:25,437 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:25,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:25,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:25,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:25,437 INFO L87 Difference]: Start difference. First operand 10166 states and 39139 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:26,358 INFO L93 Difference]: Finished difference Result 20347 states and 74827 transitions. [2025-04-13 19:03:26,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:26,362 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:26,362 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:26,433 INFO L225 Difference]: With dead ends: 20347 [2025-04-13 19:03:26,433 INFO L226 Difference]: Without dead ends: 20265 [2025-04-13 19:03:26,437 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:26,437 INFO L437 NwaCegarLoop]: 100 mSDtfsCounter, 351 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:26,437 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 530 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:03:26,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20265 states. [2025-04-13 19:03:26,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20265 to 10155. [2025-04-13 19:03:26,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10155 states, 10154 states have (on average 3.851487098680323) internal successors, (39108), 10154 states have internal predecessors, (39108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10155 states to 10155 states and 39108 transitions. [2025-04-13 19:03:26,655 INFO L79 Accepts]: Start accepts. Automaton has 10155 states and 39108 transitions. Word has length 54 [2025-04-13 19:03:26,655 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:26,655 INFO L485 AbstractCegarLoop]: Abstraction has 10155 states and 39108 transitions. [2025-04-13 19:03:26,655 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:26,655 INFO L278 IsEmpty]: Start isEmpty. Operand 10155 states and 39108 transitions. [2025-04-13 19:03:26,670 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:26,670 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:26,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:26,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable411 [2025-04-13 19:03:26,670 INFO L403 AbstractCegarLoop]: === Iteration 413 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:26,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1838004224, now seen corresponding path program 413 times [2025-04-13 19:03:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:26,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718321083] [2025-04-13 19:03:26,671 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:03:26,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:26,673 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:03:26,683 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:26,683 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:03:26,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:27,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:27,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718321083] [2025-04-13 19:03:27,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718321083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:27,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:27,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:27,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333913446] [2025-04-13 19:03:27,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:27,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:27,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:27,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:27,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:27,270 INFO L87 Difference]: Start difference. First operand 10155 states and 39108 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:28,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:28,127 INFO L93 Difference]: Finished difference Result 19178 states and 70998 transitions. [2025-04-13 19:03:28,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:28,127 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:28,127 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:28,190 INFO L225 Difference]: With dead ends: 19178 [2025-04-13 19:03:28,190 INFO L226 Difference]: Without dead ends: 19108 [2025-04-13 19:03:28,195 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:28,196 INFO L437 NwaCegarLoop]: 100 mSDtfsCounter, 359 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:28,196 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 521 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:03:28,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19108 states. [2025-04-13 19:03:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19108 to 10165. [2025-04-13 19:03:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10165 states, 10164 states have (on average 3.8501574183392364) internal successors, (39133), 10164 states have internal predecessors, (39133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10165 states to 10165 states and 39133 transitions. [2025-04-13 19:03:28,406 INFO L79 Accepts]: Start accepts. Automaton has 10165 states and 39133 transitions. Word has length 54 [2025-04-13 19:03:28,406 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:28,406 INFO L485 AbstractCegarLoop]: Abstraction has 10165 states and 39133 transitions. [2025-04-13 19:03:28,406 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:28,406 INFO L278 IsEmpty]: Start isEmpty. Operand 10165 states and 39133 transitions. [2025-04-13 19:03:28,455 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:28,455 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:28,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] [2025-04-13 19:03:28,455 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable412 [2025-04-13 19:03:28,455 INFO L403 AbstractCegarLoop]: === Iteration 414 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:28,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:28,456 INFO L85 PathProgramCache]: Analyzing trace with hash -805580332, now seen corresponding path program 414 times [2025-04-13 19:03:28,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:28,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202047969] [2025-04-13 19:03:28,456 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:03:28,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:28,458 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:03:28,467 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:28,467 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:03:28,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:29,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:29,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202047969] [2025-04-13 19:03:29,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202047969] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:29,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:29,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:29,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014418228] [2025-04-13 19:03:29,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:29,037 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:29,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:29,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:29,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:29,037 INFO L87 Difference]: Start difference. First operand 10165 states and 39133 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:29,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:29,921 INFO L93 Difference]: Finished difference Result 20246 states and 74557 transitions. [2025-04-13 19:03:29,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:29,921 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:29,921 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:29,985 INFO L225 Difference]: With dead ends: 20246 [2025-04-13 19:03:29,986 INFO L226 Difference]: Without dead ends: 20182 [2025-04-13 19:03:29,991 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:29,991 INFO L437 NwaCegarLoop]: 100 mSDtfsCounter, 340 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:29,991 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 563 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:03:30,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20182 states. [2025-04-13 19:03:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20182 to 10173. [2025-04-13 19:03:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10173 states, 10172 states have (on average 3.8490955564294143) internal successors, (39153), 10172 states have internal predecessors, (39153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10173 states to 10173 states and 39153 transitions. [2025-04-13 19:03:30,212 INFO L79 Accepts]: Start accepts. Automaton has 10173 states and 39153 transitions. Word has length 54 [2025-04-13 19:03:30,213 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:30,213 INFO L485 AbstractCegarLoop]: Abstraction has 10173 states and 39153 transitions. [2025-04-13 19:03:30,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:30,213 INFO L278 IsEmpty]: Start isEmpty. Operand 10173 states and 39153 transitions. [2025-04-13 19:03:30,227 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:30,227 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:30,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:30,227 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable413 [2025-04-13 19:03:30,228 INFO L403 AbstractCegarLoop]: === Iteration 415 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:30,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:30,228 INFO L85 PathProgramCache]: Analyzing trace with hash -917428258, now seen corresponding path program 415 times [2025-04-13 19:03:30,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:30,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536769481] [2025-04-13 19:03:30,228 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:03:30,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:30,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:03:30,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:30,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:03:30,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:30,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:30,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536769481] [2025-04-13 19:03:30,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536769481] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:30,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:30,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:30,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665432017] [2025-04-13 19:03:30,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:30,839 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:30,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:30,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:30,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:30,839 INFO L87 Difference]: Start difference. First operand 10173 states and 39153 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:31,706 INFO L93 Difference]: Finished difference Result 19184 states and 71003 transitions. [2025-04-13 19:03:31,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:31,706 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:31,707 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:31,766 INFO L225 Difference]: With dead ends: 19184 [2025-04-13 19:03:31,766 INFO L226 Difference]: Without dead ends: 19102 [2025-04-13 19:03:31,772 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:31,773 INFO L437 NwaCegarLoop]: 100 mSDtfsCounter, 314 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:31,773 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 506 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:03:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19102 states. [2025-04-13 19:03:31,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19102 to 10159. [2025-04-13 19:03:31,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10159 states, 10158 states have (on average 3.85075802323292) internal successors, (39116), 10158 states have internal predecessors, (39116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10159 states to 10159 states and 39116 transitions. [2025-04-13 19:03:31,999 INFO L79 Accepts]: Start accepts. Automaton has 10159 states and 39116 transitions. Word has length 54 [2025-04-13 19:03:32,000 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:32,000 INFO L485 AbstractCegarLoop]: Abstraction has 10159 states and 39116 transitions. [2025-04-13 19:03:32,000 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:32,000 INFO L278 IsEmpty]: Start isEmpty. Operand 10159 states and 39116 transitions. [2025-04-13 19:03:32,014 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:32,014 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:32,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:32,014 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable414 [2025-04-13 19:03:32,014 INFO L403 AbstractCegarLoop]: === Iteration 416 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:32,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:32,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2043816370, now seen corresponding path program 416 times [2025-04-13 19:03:32,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:32,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148894139] [2025-04-13 19:03:32,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:03:32,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:32,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:03:32,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:32,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:03:32,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:32,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:32,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:32,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148894139] [2025-04-13 19:03:32,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148894139] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:32,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:32,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:32,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544387269] [2025-04-13 19:03:32,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:32,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:32,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:32,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:32,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:32,702 INFO L87 Difference]: Start difference. First operand 10159 states and 39116 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:33,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:33,569 INFO L93 Difference]: Finished difference Result 20239 states and 74531 transitions. [2025-04-13 19:03:33,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:33,569 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:33,569 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:33,632 INFO L225 Difference]: With dead ends: 20239 [2025-04-13 19:03:33,632 INFO L226 Difference]: Without dead ends: 20156 [2025-04-13 19:03:33,637 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:33,637 INFO L437 NwaCegarLoop]: 100 mSDtfsCounter, 354 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:33,637 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 502 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 19:03:33,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20156 states. [2025-04-13 19:03:33,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20156 to 10147. [2025-04-13 19:03:33,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10147 states, 10146 states have (on average 3.8521584861028977) internal successors, (39084), 10146 states have internal predecessors, (39084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10147 states to 10147 states and 39084 transitions. [2025-04-13 19:03:33,854 INFO L79 Accepts]: Start accepts. Automaton has 10147 states and 39084 transitions. Word has length 54 [2025-04-13 19:03:33,854 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:33,854 INFO L485 AbstractCegarLoop]: Abstraction has 10147 states and 39084 transitions. [2025-04-13 19:03:33,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:33,855 INFO L278 IsEmpty]: Start isEmpty. Operand 10147 states and 39084 transitions. [2025-04-13 19:03:33,869 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:33,869 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:33,869 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:33,869 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable415 [2025-04-13 19:03:33,870 INFO L403 AbstractCegarLoop]: === Iteration 417 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:33,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:33,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1743660668, now seen corresponding path program 417 times [2025-04-13 19:03:33,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:33,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641218805] [2025-04-13 19:03:33,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:03:33,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:33,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 19:03:33,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:33,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:03:33,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:03:34,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:34,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:03:34,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641218805] [2025-04-13 19:03:34,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641218805] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:03:34,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:03:34,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 19:03:34,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194376102] [2025-04-13 19:03:34,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:03:34,489 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:03:34,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:34,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:03:34,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:03:34,489 INFO L87 Difference]: Start difference. First operand 10147 states and 39084 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:35,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:35,494 INFO L93 Difference]: Finished difference Result 19260 states and 71249 transitions. [2025-04-13 19:03:35,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:03:35,494 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 19:03:35,494 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:35,554 INFO L225 Difference]: With dead ends: 19260 [2025-04-13 19:03:35,554 INFO L226 Difference]: Without dead ends: 19148 [2025-04-13 19:03:35,559 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:03:35,560 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 342 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:35,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 531 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:03:35,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19148 states. [2025-04-13 19:03:35,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19148 to 10171. [2025-04-13 19:03:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10171 states, 10170 states have (on average 3.848967551622419) internal successors, (39144), 10170 states have internal predecessors, (39144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10171 states to 10171 states and 39144 transitions. [2025-04-13 19:03:35,776 INFO L79 Accepts]: Start accepts. Automaton has 10171 states and 39144 transitions. Word has length 54 [2025-04-13 19:03:35,777 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:35,777 INFO L485 AbstractCegarLoop]: Abstraction has 10171 states and 39144 transitions. [2025-04-13 19:03:35,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:35,777 INFO L278 IsEmpty]: Start isEmpty. Operand 10171 states and 39144 transitions. [2025-04-13 19:03:35,792 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 19:03:35,792 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:35,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:35,792 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable416 [2025-04-13 19:03:35,792 INFO L403 AbstractCegarLoop]: === Iteration 418 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:03:35,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:35,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1419206576, now seen corresponding path program 418 times [2025-04-13 19:03:35,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:35,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729294379] [2025-04-13 19:03:35,792 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:03:35,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:35,795 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 19:03:35,803 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 19:03:35,803 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:03:35,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2025-04-13 19:03:36,072 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 19:03:36,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable417 [2025-04-13 19:03:36,073 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 55 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while SimplifyDDA2 was simplifying 5 xjuncts wrt. a ATOM-1 context. [2025-04-13 19:03:36,074 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 19:03:36,074 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 19:03:36,074 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 19:03:36,074 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 19:03:36,076 INFO L422 BasicCegarLoop]: Path program histogram: [418] [2025-04-13 19:03:36,077 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:03:36,077 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:03:36,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:03:36 BasicIcfg [2025-04-13 19:03:36,079 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:03:36,079 INFO L158 Benchmark]: Toolchain (without parser) took 804030.92ms. Allocated memory was 155.2MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 111.1MB in the beginning and 878.6MB in the end (delta: -767.5MB). Peak memory consumption was 887.8MB. Max. memory is 8.0GB. [2025-04-13 19:03:36,079 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:03:36,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.34ms. Allocated memory is still 155.2MB. Free memory was 111.1MB in the beginning and 96.2MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 19:03:36,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.06ms. Allocated memory is still 155.2MB. Free memory was 96.2MB in the beginning and 94.0MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:03:36,079 INFO L158 Benchmark]: Boogie Preprocessor took 27.39ms. Allocated memory is still 155.2MB. Free memory was 94.0MB in the beginning and 92.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:03:36,079 INFO L158 Benchmark]: RCFGBuilder took 409.97ms. Allocated memory is still 155.2MB. Free memory was 92.0MB in the beginning and 59.0MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-13 19:03:36,079 INFO L158 Benchmark]: TraceAbstraction took 803347.68ms. Allocated memory was 155.2MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 58.0MB in the beginning and 878.6MB in the end (delta: -820.6MB). Peak memory consumption was 837.4MB. Max. memory is 8.0GB. [2025-04-13 19:03:36,079 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.13ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.34ms. Allocated memory is still 155.2MB. Free memory was 111.1MB in the beginning and 96.2MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.06ms. Allocated memory is still 155.2MB. Free memory was 96.2MB in the beginning and 94.0MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.39ms. Allocated memory is still 155.2MB. Free memory was 94.0MB in the beginning and 92.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 409.97ms. Allocated memory is still 155.2MB. Free memory was 92.0MB in the beginning and 59.0MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 803347.68ms. Allocated memory was 155.2MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 58.0MB in the beginning and 878.6MB in the end (delta: -820.6MB). Peak memory consumption was 837.4MB. 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 - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 55 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while SimplifyDDA2 was simplifying 5 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 55 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while SimplifyDDA2 was simplifying 5 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 55 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while SimplifyDDA2 was simplifying 5 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 55 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while SimplifyDDA2 was simplifying 5 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 55 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-5-1 term,while SimplifyDDA2 was simplifying 5 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 100 locations, 99 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 803.2s, OverallIterations: 418, TraceHistogramMax: 1, PathProgramHistogramMax: 418, EmptinessCheckTime: 7.1s, AutomataDifference: 422.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128603 SdHoareTripleChecker+Valid, 258.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128603 mSDsluCounter, 228494 SdHoareTripleChecker+Invalid, 220.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 182979 mSDsCounter, 11854 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 611052 IncrementalHoareTripleChecker+Invalid, 622906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11854 mSolverCounterUnsat, 45515 mSDtfsCounter, 611052 mSolverCounterSat, 2.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10416 GetRequests, 1034 SyntacticMatches, 0 SemanticMatches, 9382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18264 ImplicationChecksByTransitivity, 138.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15591occurred in iteration=0, InterpolantAutomatonStates: 6497, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 96.5s AutomataMinimizationTime, 417 MinimizatonAttempts, 3691568 StatesRemovedByMinimization, 415 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 259.0s InterpolantComputationTime, 22518 NumberOfCodeBlocks, 22518 NumberOfCodeBlocksAsserted, 486 NumberOfCheckSat, 22101 ConstructedInterpolants, 0 QuantifiedInterpolants, 396718 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 417 InterpolantComputations, 417 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown